Learning conditional random fields for stereo

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2007, Pages

  Scharstein, Daniel ^a   Pal, Chris ^b  

^a MIDDLEBURY COLLEGE   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GRADIENT METHODS; LEARNING ALGORITHMS; PARAMETER ESTIMATION; PROBABILITY; STEREO VISION;

INTENSITY GRADIENTS; OBJECT BOUNDARIES; SMOOTHNESS COSTS;

LEARNING SYSTEMS;

EID: 34948831560     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2007.383191     Document Type: Conference Paper

References (32)

1. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 47(1):7-42, 2002.
2. D. Scharstein and R. Szeliski. High-accuracy stereo depth maps using structured light. In Proc. CVPR, volume I, pages 195-202, 2003.
3. L. Zhang and S. Seitz. Parameter estimation for MRF stereo. In Proc. CVPR, volume II, pages 288-295, 2005.
4. D. Kong and H. Tao. A method for learning matching errors in stereo computation. In Proc. BMVC, 2004.
5. V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother. Probabilistic fusion of stereo with color and contrast for bilayer segmentation. IEEE TPAMI, 28(9): 1480-1492, 2006.
6. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE TPAMI, 23(11): 1222-1239, 2001.
7. V. Kolmogorov and R. Zabih. Computing visual correspondence with occlusions using graph cuts. In Proc. ICCV, volume II, pages 508-515, 2001.
8. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? In Proc. ECCV, volume III, pages 65-81, 2002.
9. J. Sun, N. Zheng, and H. Shum. Stereo matching using belief propagation. IEEE TPAMI, 25(7):787-800, 2003.
10. J. Sun, Y. Li, S. Kang, and H.-Y Shum. Symmetric stereo matching for occlusion handling. In Proc. CVPR, volume II, pages 399-406, 2005.
11. P. Felzenszwalb and D. Huttenlocher. Efficient belief propagation for early vision. IJCV, 70(1):41-54, 2006.
12. M. Tappen and W Freeman. Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters. In Proc. ICCV, pages 900-907, 2003.
13. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for Markov random fields. In Proc. ECCV, volume 2, pages 19-26, 2006.
14. H. Tao, H. Sawhney, and R. Kumar. A global matching framework for stereo computation. In Proc. ICCV, volume I, pages 532-539, 2001.
15. Y Zhang and C. Kambhamettu. Stereo matching with segmentation-based cooperation. In Proc. ECCV, volume II, pages 556-571, 2002.
16. M. Bleyer and M. Gelautz. A layered stereo algorithm using image segmentation and global visibility constraints. In Proc. ICIP, 2004.
17. L. Hong and G. Chen. Segment-based stereo matching using graph cuts. In Proc. CVPR, volume I, pages 74-81, 2004.
18. Y. Wei and L. Quan. Region-based progressive stereo matching. In Proc. CVPR, volume I, pages 106-113, 2004.
19. L. Zitnick, S. Kang, M. Uyttendaele, S. Winder, and R. Szeliski. High-quality video view interpolation using a layered representation. ACM ToG, 23(3):600-608, 2004.
20. V. Kolmogorov and R. Zabih. Multi-camera scene reconstruction via graph cuts. In Proc. ECCV, volume III, pages 82-96, 2002.
21. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. ICML, pages 282-289, 2001.
22. C. Sutton and A. McCallum. An introduction to conditional random fields for relational learning. In L. Getoor and B. Taskar, editors, Introduction to Statistical Relational Learning. MIT Press, 2006.
23. C. Sutton, K. Rohanimanesh, and A. McCallum. Dynamic conditional random fields: Factorized probabilistic models for labeling and segmenting sequence data. In Proc. ICML, 2004.
24. M. Wainwright, T. Jaakkola, and A. Willsky. Tree-based reparameterization framework for analysis of sum-product and related algorithms. IEEE Trans. Info. Theory, 45(9): 1120-1146, 2003.
25. S. Kumar and M. Hebert. Man-made structure detection in natural images using a causal multiscale random field. In Proc. CVPR, volume I, pages 119-126, 2003.
26. A. Blake, C. Rother, M. Brown, P. Perez, and P. Torr. Interactive image segmentation using an adaptive GMMRF model. In Proc. ECCV, pages 428-441, 2004.
27. R. Cowell, A. Dawid, S. Lauritzen, and D. Spiegelhalter. Probabilistic Networks and Expert Systems. Springer, 2003.
28. D. Rivait and M. Langer. Spatiotemporal power spectra of motion parallax: the case of cluttered 3D scenes. In IS&T/SPIE Symp. on El. Imaging, 2007. To appear.
29. S. Birchfield and C. Tomasi. A pixel dissimilarity measure that is insensitive to image sampling. IEEE TPAMI, 20(4):401-406, 1998.
30. F. Kschischang, B. Frey, and H.-A. Loeliger. Factor graphs and the sum-product algorithm. IEEE Trans. Info. Theory, 47(2):498-519, 2001.
31. F. Sha and F. Pereira. Shallow parsing with conditional random fields. In Proc. NAACL, pages 134-141, 2003.
32. M. Collins. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proc. EMNLP, 2002.