Abstract
The conventional technique for scene reconstruction from stereo image pairs searches for the best single surface fitting identified correspondences between the the two images. Constraints on surface continuity, smoothness, and visibility (occlusions) are incorporated into a ‘cost’ – usually an ad hoc linear combination of signal similarity criteria, with empirically selected coefficients. An unsatisfactory feature of this approach is that matching accuracy is very sensitive to correct choice of these coefficients. Also, few real scenes have only one surface, so that the single surface assumption contributes to matching errors.
We propose a noise-driven paradigm for stereo matching that does not couple the matching process with choice of surfaces by imposing constraints in the matching step. We call our strategy ‘Concurrent Stereo Matching’ because the first step involves a high degree of parallelism (making real-time implementations possible using configurable hardware): rather than search for ‘best’ matches, it first identifies all 3D volumes that match within a criteria based on noise in the image. Starting in the foreground, these volumes are then examined and surfaces are selected which exhibit high signal similarity in both images. Local constraints on continuity and visibility – rather than global ones – are used to select surfaces from the candidates identified in the first step.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burschka, D., Brown, M.Z., Hager, G.D.: Advances in computational stereo. IEEE Trans. PAMI 25, 993–1008 (2003)
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. J. Computer Vision 47, 7–42 (2002)
Poggio, T., Torre, V., Koch, C.: Computational vision and regularization theory. Nature 317, 314–319 (1985)
Hsieh, Y.C., Mckeown Jr., D.M., Perlant, F.P.: Performance evaluation of scene registration and stereo matching for cartographic feature extraction. IEEE Trans. PAMI 14, 214–238 (1992)
Zitnick, C.L., Kanade, T.: A cooperative algorithm for stereo matching and occlusion detection. IEEE Trans. PAMI 22, 675–684 (2000)
Baker, H.H.: Surfaces from mono and stereo images. Photogrammetria 39, 217–237 (1984)
Ohta, Y., Kanade, T.: Stereo by intra- and inter-scanline search using dynamic programming. IEEE Trans. PAMI 7, 139–154 (1985)
Gimel’farb, G.L.: Intensity-based computer binocular stereo vision: signal models and algorithms. Int. J. Imaging Systems and Technology, 189–200 (1991)
Sun, J., Zheng, N.N., Dshum, H.Y.: Stereo matching using belief propagation. IEEE Trans. PAMI 25(7), 787–800 (2003)
Roy, S.: Stereo without epiploar lines: A maximum-flow formulation. Int. J. Computer Vision 34, 147–161 (1999)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cut. IEEE Trans. PAMI 23, 1222–1239 (2001)
Kim, J., Kolmogorov, V., Zabih, R.: Visual correspondence using energy minimization and mutual information. In: Proc. 9th Int. Conf. Computer Vision (ICCV 2003), Nice, France, October 2003, pp. 1003–1010. IEEE Computer Society Press, Los Alamitos (2003)
Liu, J., Gimel’farb, G.: Accuracy of stereo reconstruction by minimum cut, symmetric dynamic programming, and correlation. In: Proc. IVCNZ 2004 Conf., Akaroa, New Zealand, 21-23 November, pp. 65–70 (2004)
Kutulakos, K.N., Seitz, S.M.: A theory of shape by space carving. Int. J. Computer Vision 38(3), 199–218 (2000)
Torralba, A.: Modeling global scene factors in attention. J. Optical Society of America 20A, 1407–1418 (2003)
Birchfield, S., Tomasi, C.: A pixel dissimilarity measure that is insensitive to image sampling. IEEE Trans. PAMI 20, 401–406 (1998)
Faugeras, O.: Three-Dimensional Computer Vision. A geometric Viewpoint. MIT Press, Cambridge (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delmas, P., Gimel’farb, G., Liu, J., Morris, J. (2005). A Noise-Driven Paradigm for Solving the Stereo Correspondence Problem. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds) MICAI 2005: Advances in Artificial Intelligence. MICAI 2005. Lecture Notes in Computer Science(), vol 3789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11579427_31
Download citation
DOI: https://doi.org/10.1007/11579427_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29896-0
Online ISBN: 978-3-540-31653-4
eBook Packages: Computer ScienceComputer Science (R0)