Abstract
In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF’s). These three MRF’s model a smooth field for depth/disparity, a line process for depth discontinuity and a binary process for occlusion, respectively. After eliminating the line process and the binary process by introducing two robust functions, we obtain the maximum a posteriori (MAP) estimation in the Markov network by applying a Bayesian belief propagation (BP) algorithm. Furthermore, we extend our basic stereo model to incorporate other visual cues (e.g., image segmentation) that are not modeled in the three MRF’s, and again obtain the MAP solution. Experimental results demonstrate that our method outperforms the state-of-art stereo algorithms for most test cases.
This work was performed while the first author was visiting Microsoft Research Asia
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
P.N. Belhumeur. A bayesian-approach to binocular stereopsis. IJCV, 19(3):237–260, 1996.
S. Birchfield and C. Tomasi. A pixel dissimilarity measure that is insensitive to image sampling. PAMI, 20(4):401–406, 1998.
M.J. Black and A. Rangarajan. On the unification of line processes, outlier rejection, and robust statistics with applications in early vision. IJCV, 19(1):57–91, 1996.
A. Blake and A Zisserman. Visual reconstruction. MIT Press, 1987.
A.F. Bobick and S.S. Intille. Large occlusion stereo. IJCV, 33(3):1–20, 1999.
Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. ICCV, 1999.
D. Comaniciu and P. Meer. Robust analysis of feature spaces: Color image segmentation. CVPR, 1997.
I.J. Cox, S.L. Hingorani, S.B. Rao, and B.M. Maggs. A maximum-likelihood stereo algorithm. CVIU, 63(3):542–567, 1996.
W.T. Freeman, E.C. Pasztor, and O.T. Carmichael. Learning low-level vision. IJCV, 40(1):25–47, 2000.
D. Geiger and F. Girosi. Parallel and deterministic algorithms from mrfs: Surface reconstruction. PAMI, 13(5):401–412, 1991.
D. Geiger, B. Ladendorf, and A. Yuille. Occlusions and binocular stereo. IJCV, 14(3):211–226, 1995.
S. Geman and D. Geman. Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. PAMI, 6(6):721–741, 1984.
H. Hirschmueller. Improvements in real-time correlation-based stereo vision. IEEE Workshop on Stereo and Multi-Baseline Vision, 2001.
B.K.P. Horn and M.J. Brooks. The variational approach to shape from shading. CVGIP, 33(2):174–208, 1986.
H. Ishikawa and D. Geiger. Occlusions, discontinuities, and epipolar lines in stereo. ECCV, 1998.
T. Kanade and M. Okutomi. A stereo matching algorithm with an adaptive window: Theory and experiment. PAMI, 16(9):920–932, 1994.
V. Kolmogorov and R. Zabih. Computing visual correspondence with occlusions via graph cuts. ICCV, 2001.
S. Osher L.I. Rudin and E. Fatemi. Nonlinear total variation based noise removal algorithms. Physica D, 27(60):259–268, 1992.
Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, San Mateo, California, 1988.
D. Scharstein and R. Szeliski. Stereo matching with nonlinear diffusion. IJCV, 28(2):155–174, 1998.
D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 47(1):7–42, 2002.
H. Tao, H.S. Sawhney, and R. Kumar. A global matching framework for stereo computation. ICCV, 2001.
O. Veksler. Stereo matching by compact windows via minimum ratio cycle. ICCV, 2001.
W. T. Yedidia, J. S. Freeman and Weiss Y. Bethe free energy, kikuchi approximations, and belief propagation algorithms. Technical Report TR-2001-16, Mitsubishi Electric Reseach, 2001.
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
Sun, J., Shum, HY., Zheng, NN. (2002). Stereo Matching Using Belief Propagation. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds) Computer Vision — ECCV 2002. ECCV 2002. Lecture Notes in Computer Science, vol 2351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47967-8_34
Download citation
DOI: https://doi.org/10.1007/3-540-47967-8_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43744-4
Online ISBN: 978-3-540-47967-3
eBook Packages: Springer Book Archive