EFFICIENT SURFACE-AWARE SEMI-GLOBAL MATCHING WITH MULTI-VIEW PLANE-SWEEP SAMPLING

Automatic Multi-view Surface Matching

In this paper we tackle the problem of automatically aligning an unordered set of range views. We propose a full pipeline that goes from the scans to the complete 3D model. The emphasis is on the automation – no manual intervention is require – and on the fact that no knowledge on the acquisition sequence is assumed. The contribution is twofold: in the pre-alignment phase a voting scheme is pro...

Space-Efficient Plane-Sweep Algorithms

We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of n items and that the available workspace is Θ(s) bits, where lgn ≤ s ≤ n · lg n. In particular, we give an almost-optimal algorithm for finding the closest pair among a set of n points that runs in O(n/s+n·lg s) time. We give a simple algorithm to enum...

Efficient Semi-global Matching for Trinocular Stereo

This paper describes an efficient method for dense matching of two or three images. After some investigations in different similarity measures we propose a modification of Semi-Global Matching, which uses a simple energy function that implies piecewise smoothness but no ordering and gives promising results in practice. Our improvements include a symmetric and hierarchical matching strategy and ...

Semi-Global Stereo Matching with Surface Orientation Priors

Semi-Global Matching (SGM) is a widely-used efficient stereo matching technique. It works well for textured scenes, but fails on untextured slanted surfaces due to its fronto-parallel smoothness assumption. To remedy this problem, we propose a simple extension, termed SGM-P, to utilize precomputed surface orientation priors. Such priors favor different surface slants in different 2D image regio...

Seamless Stitching using Multi-Perspective Plane Sweep