Stereo matching with symmetric cost functions

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

Volumn 2, Issue , 2006, Pages 2371-2377

  Yoon, Kuk Jin ^a   Kweon, In So ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF PROPAGATION (BP); COST FUNCTIONS; MARKOV RANDOM FIELD (MRF); STEREO METHODS;

COLOR; GLOBAL OPTIMIZATION; IMAGE SEGMENTATION; MARKOV PROCESSES; PROBLEM SOLVING; STEREO VISION;

PATTERN MATCHING;

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

References (16)

1. 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, 1998.
2. A. F. Bobick and S. S. Intille. Large occlusion stereo. International Journal of Computer Vision, 33(3):181-200, 1999.
3. 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, 2001.
4. T. Kanade and M. Okutomi. A stereo matching algorithm with an adaptive window: theory and experiment. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(9):920-932, 1994.
5. S. B. Kang, R. Szeliski, and J. Chai. Handling occlusions in dense multi-view stereo. In IEEE Conference on Computer Vision and Pattern Recognition, volume 1, pages 103-110, 2001.
6. V. Kolmogorov and R. Zabih. Computing visual correspondence with occlusions via graph cuts. In International Conference on Computer Vision, volume 2, pages 508-515, 2001.
7. D. Marr and T. Poggio. Cooperative computation of stereo disparity. Science, 194(4262):283-287, 1976.
8. D. Scharstein and R. Szeliski. Stereo matching with non-linear diffusion. International Journal of Computer Vision, 28(2): 155-174, 1998.
9. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision, 47(1-3):7-42, 2002.
10. J. Sun, Y. Li, S. B. Kang, and H.-Y. Shum. Symmetric stereo matching for occlusion handling. In IEEE Conference on Computer Vision and Pattern Recognition, volume 2, pages 399-406, 2005.
11. J. Sun, N.-N. Zheng, and H.-Y. Shum. Stereo matching using belief propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(7):787-800, 2003.
12. M. F. Tappen and W. T. Freeman. Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters. In International Conference on Computer Vision, volume 2, pages 900-906, 2003.
13. O. Veksler. Stereo correspondence with compact windows via minimum ratio cycle. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(12): 1654-1660, 2002.
14. O. Veksler. Fast variable window for stereo correspondence using integral images. In IEEE Conference on Computer Vision and Pattern Recognition, volume 1, pages 556-561, 2003.
15. K.J. Yoon and I. S. Kweon. Adaptive support-weight approach for correspondence search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(4):650-656, 2006.
16. C. Zitnick and T. Kanade. A cooperative algorithm for stereo matching and occlusion detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(7): 675-684, 2000.