Stereo matching using belief propagation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2351, Issue , 2002, Pages 510-524

  Sun, Jian ^a,b   Shum, Heung Yeung ^b   Zheng, Nan Ning ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; IMAGE SEGMENTATION; MAGNETORHEOLOGICAL FLUIDS; MARKOV PROCESSES;

BELIEF PROPAGATION; BELIEF PROPAGATION ALGORITHM; DEPTH DISCONTINUITIES; MARKOV NETWORKS; MARKOV RANDOM FIELDS; MAXIMUM A POSTERIORI ESTIMATION; STEREO ALGORITHMS; STEREO MATCHING;

STEREO IMAGE PROCESSING;

EID: 84948964759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47967-8_34     Document Type: Conference Paper

References (24)

1. P.N. Belhumeur. A bayesian-approach to binocular stereopsis. IJCV, 19(3):237-260, 1996.
2. S. Birchfield and C. Tomasi. A pixel dissimilarity measure that is insensitive to image sampling. PAMI, 20(4):401-406, 1998.
3. 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.
4. A. Blake and A Zisserman. Visual reconstruction. MIT Press, 1987.
5. A.F. Bobick and S.S. Intille. Large occlusion stereo. IJCV, 33(3):1-20, 1999.
6. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. ICCV, 1999.
7. D. Comaniciu and P. Meer. Robust analysis of feature spaces: Color image segmentation. CVPR, 1997.
8. I.J. Cox, S.L. Hingorani, S.B. Rao, and B.M. Maggs. A maximum-likelihood stereo algorithm. CVIU, 63(3):542-567, 1996.
9. W.T. Freeman, E.C. Pasztor, and O.T. Carmichael. Learning low-level vision. IJCV, 40(1):25-47, 2000.
10. D. Geiger and F. Girosi. Parallel and deterministic algorithms from mrfs: Surface reconstruction. PAMI, 13(5):401-412, 1991.
11. D. Geiger, B. Ladendorf, and A. Yuille. Occlusions and binocular stereo. IJCV, 14(3):211-226, 1995.
12. S. Geman and D. Geman. Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. PAMI, 6(6):721-741, 1984.
13. H. Hirschmueller. Improvements in real-time correlation-based stereo vision. IEEE Workshop on Stereo and Multi-Baseline Vision, 2001.
14. B.K.P. Horn and M.J. Brooks. The variational approach to shape from shading. CVGIP, 33(2):174-208, 1986.
15. H. Ishikawa and D. Geiger. Occlusions, discontinuities, and epipolar lines in stereo. ECCV, 1998.
16. T. Kanade and M. Okutomi. A stereo matching algorithm with an adaptive window: Theory and experiment. PAMI, 16(9):920-932, 1994.
17. V. Kolmogorov and R. Zabih. Computing visual correspondence with occlusions via graph cuts. ICCV, 2001.
18. S Osher L, I. Rudin and E. Fatemi. Nonlinear total variation based noise removal algorithms. Physica D, 27(60):259-268, 1992.
19. Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, San Mateo, California, 1988.
20. D. Scharstein and R. Szeliski. Stereo matching with nonlinear diffusion. IJCV, 28(2):155-174, 1998.
21. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 47(1):7-42, 2002.
22. H. Tao, H.S. Sawhney, and R. Kumar. A global matching framework for stereo computation. ICCV, 2001.
23. O. Veksler. Stereo matching by compact windows via minimum ratio cycle. ICCV, 2001.
24. 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.