loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Surfaces with Occlusions from Layered Stereo
August 2004 (vol. 26 no. 8)
pp. 1073-1078
ASCII Text
x 
 
Michael H. Lin, Carlo Tomasi, "Surfaces with Occlusions from Layered Stereo," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 8, pp. 1073-1078, August, 2004.
 
 
BibTex
x
 
@article{ 10.1109/TPAMI.2004.54,
author = {Michael H. Lin and Carlo Tomasi},
title = {Surfaces with Occlusions from Layered Stereo},
journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = {26},
number = {8},
issn = {0162-8828},
year = {2004},
pages = {1073-1078},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2004.54},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
TI - Surfaces with Occlusions from Layered Stereo
IS - 8
SN - 0162-8828
SP1073
EP1078
EPD - 1073-1078
A1 - Michael H. Lin,
A1 - Carlo Tomasi,
PY - 2004
KW - Binocular stereo vision
KW - energy minimization
KW - graph cuts
KW - hybrid system
KW - smooth surfaces
KW - surface fitting
KW - boundary localization
KW - sharp discontinuities
KW - quantitative comparison.
VL - 26
JA - IEEE Transactions on Pattern Analysis and Machine Intelligence
ER -
 

Abstract—We propose a new binocular stereo algorithm that estimates scene structure as a collection of smooth surface patches. The disparities within each patch are modeled by a continuous-valued spline, while the extent of each patch is represented via a pixelwise partitioning of the images. Disparities and extents are alternately estimated in an iterative, energy minimization framework. Experimental results demonstrate that, for scenes consisting of smooth surfaces, the proposed algorithm significantly improves upon the state of the art.

[1] S. Baker, R. Szeliski, and P. Anadan, A Layered Approach to Stereo Reconstruction Proc. IEEE Computer Vision and Pattern Recognition 1998 (CVPR '98) Conf., 1998.[2] S. Barnard and M. Fischler, Computational Stereo Computing Surveys, vol. 14, pp. 553-572, 1982.[3] P.N. Belhumeur, A Bayesian Approach to Binocular Stereopsis Int'l J. Computer Vision, vol. 19, pp. 237-260, 1996.[4] S. Birchfield and C. Tomasi, Multiway Cut for Stereo and Motion with Slanted Surfaces Proc. Int'l Conf. Computer Vision, pp. 489-495, 1999.[5] A.F. Bobick and S.S. Intille, Large Occlusion Stereo Int'l J. Computer Vision, vol. 33, no. 3, pp. 181-200, 1999.[6] Y. Boykov, O. Veksler, and R. Zabih, Fast Approximate Energy Minimization via Graph Cuts IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, Nov. 2001.[7] I.J. Cox, S.L. Hingorani, S.B. Rao, and B. Maggs, A Maximum Likelihood Stereo Algorithm Proc. Computer Vision and Image Understanding, vol. 63, no. 3, pp. 542-567, 1996.[8] T. Darrell and A. Pentland, "Cooperative Robust Estimation Using Layers of Support," Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 5, pp. 474-487, May 1995.[9] U. Dhond and J.K. Aggarwal, "Structure From Stereo—A Review," IEEE Trans. Systems, Man, and Cybernetics, vol. 19, no. 6, pp. 1,489-1,510, Nov. 1989.[10] D. Geiger, B. Ladendorf, and A. Yuille, Occlusions and Binocular Stereo Int'l J. Computer Vision, vol. 14, no. 3, pp. 211-226, 1995.[11] H. Ishikawa and D. Geiger, Occlusions, Discontinuities, and Epipolar Lines in Stereo Proc. European Conf. Computer Vision, vol. 1, pp. 232-249, 1998.[12] T. Kanade and M. Okutomi, “A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 920-932, 1994.[13] V. Kolmogorov and R. Zabih, Visual Correspondence with Occlusions Using Graph Cuts Proc. Int'l Conf. Computer Vision, pp. 508-515, 2001.[14] M. Lin, Surfaces with Occlusions from Layered Stereo PhD thesis, Stanford Univ., 2002, http://robotics.stanford.edu/~michelinlayered _stereo /.[15] D. Marr and T. Poggio, Cooperative Computation of Stereo Disparity Science, vol. 194, pp. 283-287, 1976.[16] T. Poggio, V. Torre, and C. Koch, Computational Vision and Regularization Theory Nature, vol. 317, pp. 314-319, 1985.[17] S. Roy and I. Cox, A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem IEEE Proc. Int'l Conf. Computer Vision, pp. 492-499, 1998.[18] D. Scharstein and R. Szeliski, A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms Int'l J. Computer Vision, vol. 47, pp. 7-42, 2002, http://www.middlebury.edustereo/.[19] R. Szeliski and J. Coughlan, Spline-Based Image Registration Int'l J. Computer Vision, vol. 22, no. 3, pp. 199-218, 1997.[20] H. Tao, H. Sawhney, and R. Kumar, A Global Matching Framework for Stereo Computation Proc. Int'l Conf. Computer Vision, pp. 532-539, 2001.[21] C. L. Zitnick and T. Kanade, A Cooperative Algorithm for Stereo Matching and Occlusion Detection IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 7, July 2000.

Index Terms:
Binocular stereo vision, energy minimization, graph cuts, hybrid system, smooth surfaces, surface fitting, boundary localization, sharp discontinuities, quantitative comparison.
Citation:
Michael H. Lin, Carlo Tomasi, "Surfaces with Occlusions from Layered Stereo," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 8, pp. 1073-1078, Aug. 2004, doi:10.1109/TPAMI.2004.54
Usage of this product signifies your acceptance of the Terms of Use.