To compute reliable dense depth maps, a stereo algorithm must preserve depth
discontinuities and avoid gross errors. In this paper, we show how simple and parallel …

4 Conclusion In this work we have described a correlation based algo-rithm that combines
two simple and parallel techniques to yield reliable depth maps in the presence of depth …

In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches
individual pixels in corresponding scanlines by minimizing a cost function. Several cost …

This paper describes a new algorithm for solving the stereo correspondence problem with a
global 2-d optimization by transforming it into a maximum-flow problem in a graph. This …

Computational stereo is broadly defined as the recovery of the three-dimensional
characteristics of a scene from multiple images taken from different points of view. First, each …

Stereo correspondence algorithms typically produce a single depth map. In addition to the
usual problems of occlusions and textureless regions, such algorithms cannot model the …

We present a viewpoint-based approach for the quick fusion of multiple stereo depth maps.
Our method selects depth estimates for each pixel that minimize violations of visibility …

A stereo algorithm is presented that optimizes a maximum likelihood cost function. The
maximum likelihood cost function assumes that corresponding features in the left and right …

While many algorithms for computing stereo correspondence have been proposed, there
has been very little work on experimentally evaluating algorithm performance, especially …

In this paper, we investigate how the recently emerged photography technology-the light
field-can benefit depth map estimation, a challenging computer vision problem. A novel …