Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters

Proceedings of the IEEE International Conference on Computer Vision

Volumn 2, Issue , 2003, Pages 900-907

  Tappen, Marshall F ^a   Freeman, William T ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MARKOV PROCESSES; OPTIMIZATION; STEREO VISION;

BELIEF PROPAGATION; GRAPH CUT; MARKOV RANDOM FIELD;

COMPUTER VISION;

EID: 0344983321     PISSN: 15505499     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccv.2003.1238444     Document Type: Conference Paper

References (16)

1. J. Besag. Spatial interaction and the statistical analysis of lattice systems. J. Royal Statistical Society B, 36:192-326, 1974.
2. S. Birchfield and C. Tomasi. A pixel dissimilarity measure that is insensitive to image sampling. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(4):401-406, April 1998.
3. S. Birchfield and C. Tomasi. Multiway cut for stereo and motion with slanted surfaces. In Proceedings of the Seventh IEEE International Conference on Computer Vision, pages 489-495, 1999.
4. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in computer vision. In Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, volume 2134 of Lecture Notes in Computer Science, pages 359-374. Springer, September 2001.
5. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11):1222-1239, November 2001.
6. W. Freeman, E. C. Pasztor, and O. T. Carmichael. Learning low-level vision. International Journal of Computer Vision, 40(1):25-47, 2000.
7. B. J. Frey, R. Koetter, and N. Petrovic. Very loopy belief propagation for unwrapping phase images. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
8. V. Kolmogorov and R. Zabih. Multi-camera scene reconstruction via graph cuts. In ECCV (3), volume 2352 of Lecture Notes in Computer Science, pages 82-96, 2002.
9. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? In ECCV (3), volume 2352 of Lecture Notes in Computer Science, pages 65-81, 2002.
10. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense stereo. International Journal of Computer Vision, 47(1):7-42, 2000.
11. J. Sun, H.-Y. Shum, and N.-N. Zheng. Stereo matching using belief propagation. In A. Heyden, G. Sparr, M. Nielsen, and P. Johansen, editors, Computer Vision - ECCV 2002, number 2351 in Lecture Notes in Computer Science, pages 510-524, 2002.
12. O. Veksler. Efficient Graph-Based Energy Minimization Methods in Computer Vision. PhD thesis, Cornell University, 1999.
13. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. Technical report, Laboratory for Information and Decision Systems, MIT, 2002.
14. Y. Weiss. Interpreting images by propagating bayesian beliefs. In Advances in Neural Information Processing Systems 9, pages 908-915, 1997.
15. Y. Weiss and W. T. Freeman. On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs. IEEE Trans. Information Theory, Special Issue on Codes on Graphs and Iterative Algorithms, 47(2):723-735, 2001.
16. J. Yedidia, W. T. Freeman, and Y. Weiss. Understanding belief propagation and its generalizations. International Joint Conference on Artificial Intelligence (IJCAI 2001) Distinguished Papers Track, 2001.