Reducing search space for stereo correspondence with graph cuts

BMVC 2006 - Proceedings of the British Machine Vision Conference 2006

Volumn , Issue , 2006, Pages 709-718

  Veksler, Olga ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; COMPUTER VISION; FLOW GRAPHS; GRAPHIC METHODS;

AVERAGE ENERGY; COMPUTATIONAL COSTS; HIERARCHICAL APPROACH; LOCAL METHODS; MAX FLOW ALGORITHM; RANGE REDUCTION; SEARCH SPACES; STEREO CORRESPONDENCES;

IMAGE SEGMENTATION;

EID: 84898033274     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. S. Birchfield and C. Tomasi. A pixel dissimilarity measure that is insensitive to image sampling. IEEE TPAMI, 20(4):401-406, April 1998.
2. S. Birchfield and C. Tomasi. Multiway cut for stereo and motion with slanted surfaces. In ICCV99, pages 489-495, 1999.
3. G. Borgefors. Hierarchical chamfer matching: A parametric edge matching algorithm. PAMI, 10(6):849-865, November 1988.
4. Y. Boykov, O. Veksler, and R. Zabih. Markov random fields with efficient approximations. In IEEE CVPR, pages 648-655, 1998.
5. Yuri Boykov and Vladimir Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE TPAMI, 26(9):1124-1137, September 2004.
6. Y. Deng, Q. Yang, X. Lin, and X. Tang. A symmetric patch-based correspondence model for occlusion handling. In ICCV 2005, pages II: 1316-1322, 2005.
7. P.F. Felzenszwalb and D.P. Huttenlocher. Efficient belief propagation for early vision. In CVPR 2004, pages I: 261-268, 2004.
8. L. Hong and G. Chen. Segment-based stereo matching using graph cuts. In CVPR04, pages I: 74-81, 2004.
9. Vladimir Kolmogorov and Ramin Zabih. Computing visual correspondence with occlusions via graph cuts. In ICCV, July 2001.
10. Vladimir Kolmogorov and Ramin Zabih. Multi-camera scene reconstruction via graph cuts. In 7th ECCV, volume III of LNCS 2352, pages 82-96, Copenhagen, Denmark, May 2002. Springer-Verlag.
11. M.H. Lin and C. Tomasi. Surfaces with occlusions from layered stereo. PAMI, 26(8):1073-1078, August 2004.
12. T. Meltzer, C. Yanover, and Y. Weiss. Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In ICCV05, pages I: 428-435, 2005.
13. Daniel Scharstein and Richard Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 47(1/3):7-42, April-June 2002.
14. J. Sun, N. Zheng, and H. Shum. Stereo matching using belief propagation. IEEE TPAMI, 25(7):787-800, September 2004.
15. Y. Wei, M. Lhuillier, and L. Quan. Fast segmentation-based dense stereo from quasi-dense matching. In ACCV 2004, 2004.