Abstract

Abstract. Online augmentation of an oblique aerial image sequence with structural information is an essential aspect in the process of 3D scene interpretation and analysis. One key aspect in this is the efficient dense image matching and depth estimation. Here, the Semi-Global Matching (SGM) approach has proven to be one of the most widely used algorithms for efficient depth estimation, providing a good trade-off between accuracy and computational complexity. However, SGM only models a first-order smoothness assumption, thus favoring fronto-parallel surfaces. In this work, we present a hierarchical algorithm that allows for efficient depth and normal map estimation together with confidence measures for each estimate. Our algorithm relies on a plane-sweep multi-image matching followed by an extended SGM optimization that allows to incorporate local surface orientations, thus achieving more consistent and accurate estimates in areasmade up of slanted surfaces, inherent to oblique aerial imagery. We evaluate numerous configurations of our algorithm on two different datasets using an absolute and relative accuracy measure. In our evaluation, we show that the results of our approach are comparable to the ones achieved by refined Structure-from-Motion (SfM) pipelines, such as COLMAP, which are designed for offline processing. In contrast, however, our approach only considers a confined image bundle of an input sequence, thus allowing to perform an online and incremental computation at 1Hz–2Hz.

Highlights

  • Dense image matching is one of the most important and intensively studied task in photogrammetric computer vision

  • We propose an algorithm that extends Semi-Global Matching (SGM) to a multi-image matching, which allows for online augmentation of an aerial image sequence with structural information and focuses on oblique imagery captured from small unmanned aerial vehicles (UAVs)

  • This paper is structured as follows: In Section 2, we briefly summarize the related work on algorithms that rely on SGM and allow for efficient image-based depth estimation

Read more

Summary

Introduction

Dense image matching is one of the most important and intensively studied task in photogrammetric computer vision. Since local methods only consider a confined neighborhood by aggregating a matching cost in a local aggregation window, they can be computed very efficiently, allowing to achieve real-time processing. Their smoothness assumptions are restricted to the local support region and the accuracies achieved by these methods are typically not in the order of those achieved by global methods

Methods
Results
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call