Abstract
Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorithmic approaches. These approaches include techniques such as dynamic programming min-cut and alpha-expansion. In this paper we show how an algorithmic technique that constructs a discrete spatial minimal cost surface can be brought to bear on stereo global minimization problems. This problem can then be reduced to a single min-cut problem. We use this approach to solve a new global minimization problem that naturally arises when solving for three-camera (trinocular) stereo. Our formulation treats the three cameras symmetrically, while imposing a natural occlusion cost and uniqueness constraint.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Ayache and C. Hansen. Rectification of images for binocular and trinocular stereovision. Proc. International Conference on Pattern Recognition 1998, pages 11–16.
H. Baker. Depth from edge and intensity based stereo. PhD thesis, University of Illinois at Urbina Chanmpaign, 1981.
P. Belumeur and D. Mumford. A bayesian treatment of the stereo correspondance problem using half-occluded regions. IEEE CVPR’ 92.
S. Birchfield and C. Tomasi. A pixel dissimilarity measure that is insensitive to image sampling. IEEE PAMI, 20(4):401–406, 1998.
C. Chekuri, A. Goldberg, D. Karger, M. Levine, and C. Stein. Experimental study of minimum cut algorithms. Proc ACM SODA, 1997.
B. Cherkassky and A. Goldberg. Prf library from http://www.star-lba.com/goldberg/soft.html.
T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 2001.
I. Cox, S. Hingorani, B. Maggas, and S. Rao. A maximum likelihood stereo algorithm. Computer vision and image understanding, 63(3), 1996.
D. Geiger, B. Landendorf, and A. Yuille. Occlusion and binocular stereo. IJCV, 14:211–226, 1995.
Aaron Isaksen. toys dataset by request.
H. Ishikawa and D. Geiger. Occlusions, discontinuities, and epipolar lines in stereo. Proc. ECCV98.
V. Kolmogorov and R. Zabih. Computing visual correspondence with occlusions using graph cuts. Proc. ICCV 2001.
Y. Ohta and T. Kanade. Stereo by intra and inter scanline search using dynamic programming. IEEEPAMI, 7(2):139–154, 1985.
J. O’Rourke. Computational Geometry in C. Cambridge University Press, 1994.
S. Roy and I. Cox. A maximum-flow formulation of the n-camera stereo correspondence problem. Proc. ICCV 1998.
S. Seitz and C. Dyer. Photorealistic scene reconstruction by voxel coloring. IJCV, 35(2):151–173, 1999.
D. Snow, P. Viola, and R. Zabih. Exact voxel occupancy with graph cuts. Proc. IEEE CVPR 2000.
J. Sullivan. A Crystalline Approximation Theorem for Hypersurfaces. PhD thesis, Dept. of Mathematics, Princeton University, 1990.
Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. Proc. ICCV 1999.
Y. Boykov, O. Veksler, and R. Zabih. Markov random fields with efficient approximations. Proc. IEEE CVPR 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buehler, C., Gortler, S.J., Cohen, M.F., McMillan, L. (2002). Minimal Surfaces for Stereo. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds) Computer Vision — ECCV 2002. ECCV 2002. Lecture Notes in Computer Science, vol 2352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47977-5_58
Download citation
DOI: https://doi.org/10.1007/3-540-47977-5_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43746-8
Online ISBN: 978-3-540-47977-2
eBook Packages: Springer Book Archive