A taxonomy and evaluation of dense two-frame stereo correspondence algorithms

A taxonomy and evaluation of dense two-frame stereo correspondence algorithms (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Daniel Scharstein , Richard Szeliski

Venue:	International Journal of Computer Vision
Citations:	709 - 18 self

BibTeX

@ARTICLE{Scharstein02ataxonomy,
    author = {Daniel Scharstein and Richard Szeliski},
    title = {A taxonomy and evaluation of dense two-frame stereo correspondence algorithms},
    journal = {International Journal of Computer Vision},
    year = {2002},
    volume = {47},
    pages = {7--42}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Abstract. Stereo matching is one of the most active research areas in computer vision. While a large number of algorithms for stereo correspondence have been developed, relatively little work has been done on characterizing their performance. In this paper, we present a taxonomy of dense, two-frame stereo methods. Our taxonomy is designed to assess the different components and design decisions made in individual stereo algorithms. Using this taxonomy, we compare existing stereo methods and present experiments evaluating the performance of many different variants. In order to establish a common software platform and a collection of data sets for easy evaluation, we have designed a stand-alone, flexible C++ implementation that enables the evaluation of individual components and that can easily be extended to include new algorithms. We have also produced several new multi-frame stereo data sets with ground truth and are making both the code and data sets available on the Web. Finally, we include a comparative evaluation of a large set of today’s best-performing stereo algorithms.

Citations

3011	Stochastic Relaxation, Gibbs Distributions and the Bayesian Restoration of Images - Geman, Geman - 1984
2367	A computational approach to edge detection - Canny - 1986
1481	An Iterative Image Registration Technique with an Application to Stereo Vision - Lucas, Kanade - 1981
907	Fast approximate energy minimization via graph cuts - Boykov, Veksler, et al.
869	S.(1994) Performance of Optical Flow Techniques - Barron, Fleet, et al.
849	The Laplacian pyramid as a compact image code - Burt, Adelson - 1983
717	Vision: Computational investigation into human representation and processing of visual information - Marr - 1982
588	A Survey of image registration techniques - Brown - 1992
569	A Flexible New Technique for Camera Calibration - Zhang
523	Hierarchical Model-Based Motion Estimation - BERGEN, ANANDAN, et al. - 1992
401	A computational framework and an algorithm for the measurement of visual motion - Anandan - 1989
383	Multiple View Geometry - Hartley, Zisserman - 2003
363	A Theory of Shape by Space Carving - Seitz - 2000
328	Photorealistic scene reconstruction by voxel coloring - seitz, Dyer - 1997
319	Layered depth images - Shade, Gortler, et al. - 1998
278	A computational theory of human stereo vision - Marr, Poggio - 1979
260	Determining the epipolar geometry and its uncertainty : A - Zhang - 1996
255	The Geometry of Multiple Images - Faugeras, Luong - 2001
227	A stereo matching algorithm with an adaptive window: theory and experiment - Kanade, 1994
217	Cooperative computation of stereo disparity - Marr, Poggio - 1976
216	Regularization of Inverse Visual Problems Involving Discontinuities - Terzopoulos - 1986
215	Computational vision and regularization theory - Poggio, Torre, et al. - 1985
195	Computing Visual Correspondence with Occlusions Using Graph Cuts - Kolmogorov, Zabih - 2001
193	A maximum-flow formulation of the ncamera stereo correspondence problem - Roy, Cox - 1998
191	Kalman filter-based algorithms for estimating depth from image sequences - Matties, Kanade, et al. - 1989
185	Epipolar-plane image analysis: An approach to determining structure from motion - Bolles, Baker, et al. - 1987
184	Stereo by intra- and inter-scanline search using dynamic programming - Ohta, Kanade - 1985
170	Bayesian modeling of uncertainty in low-level vision - Szeliski - 1990
168	A Maximum Likelihood Stereo Algorithm - Cox, Hingorani, et al. - 1996
163	Probabilistic solution of ill-posed problems in computational vision - Marroquin, Mitter, et al. - 1987
159	On the unification of line processes, outlier rejection, and robust statistics with applications in early vision - Black, Rangarajan - 1996
156	Probability distributions of optical flow - Simoncelli, Adelson - 1991
153	Variational principles, surface evolution, PDEs, level set methods and the stereo problem - Keriven, Faugeras - 1998
142	Non-parametric local transforms for computing visual correspondence - Zabih, Woodfill - 1994
141	A space-sweep approach to true multi-image matching, in - Collins - 1996
135	Layered representation for motion analysis - Wang, Adelson - 1993
131	A Framework for Robust Estimation of Optical Flow - Black, Anandan - 1993
124	PMF: A stereo correspondence algorithm using a disparity gradient limit - Pollard, Mayhew, et al. - 1985
123	A pixel dissimilarity measure that is insensitive to image sampling - Birchfield, Tomasi - 1998
122	Hierarchical Spline-Based Image Registration - Szeliski, Coughlan - 1994
114	Depth discontinuities by pixel-to-pixel stereo - Birchfield, Tomasi - 1998
108	and T.O.Binford. Depth from edge and intensity based stereo - Baker - 1981
106	Occlusions and binocular stereo - Geiger, Ladendorf, et al. - 1995
104	Acomputational framework for determining stereo correspondence from a set of linear spatial lters - Jones, Malik - 1992
103	Object-centered surface reconstruction: Combining multi-image stereo and shading - Fua, Leclerc - 1995
102	A parallel stereo algorithm that produces dense depth maps and preserves image features - Fua - 1993
101	A Bayesian approach to binocular stereopsis - Belhumeur - 1996
93	Multiway cut for stereo and motion with slanted surfaces - Birchfield, Tomasi - 1999
90	Handling occlusions in dense multi-view stereo - Kang, Szeliski, et al.
86	M.: Digital video Processing - TEKALP - 1995