This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Unambiguous Stereo Matching Using Reliability-Based Dynamic Programming
June 2005 (vol. 27 no. 6)
pp. 998-1003
An efficient unambiguous stereo matching technique is presented in this paper. Our main contribution is to introduce a new reliability measure to dynamic programming approaches in general. For stereo vision application, the reliability of a proposed match on a scanline is defined as the cost difference between the globally best disparity assignment that includes the match and the globally best assignment that does not include the match. A reliability-based dynamic programming algorithm is derived accordingly, which can selectively assign disparities to pixels when the corresponding reliabilities exceed a given threshold. The experimental results show that the new approach can produce dense (>70 percent of the unoccluded pixels) and reliable (error rate <0.5 percent) matches efficiently (<0.2 sec on a 2GHz P4) for the four Middlebury stereo data sets.

[1] A.F. Bobick and S.S. Intille, “Large Occlusion Stereo,” Int'l J. Computer Vision, vol. 33, no. 3, pp. 181-200, Sept. 1999.
[2] Y. Boykov, O. Veksler, and R. Zabih, “Fast Approximate Energy Minimization via Graph Cuts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, Nov. 2001.
[3] P.F. Felzenszwalb and D.P. Huttenlocher, “Efficient Belief Propagation for Early Vision,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, June 2004.
[4] D. Geiger, B. Ladendorf, and A. Yuille, “Occlusions and Binocular Stereo,” Proc. European Conf. Computer Vision, pp. 425-433, 1992.
[5] M. Gong and Y.-H. Yang, “Fast Stereo Matching Using Reliability-Based Dynamic Programming and Consistency Constraints,” Proc. Int'l Conf. Computer Vision, pp. 610-617, Oct. 2003.
[6] R. Manduchi and C. Tomasi, “Distinctiveness Maps for Image Matching,” Proc. Int'l Conf. Image Analysis and Processing, pp. 26-31, 1999.
[7] Y. Ohta and T. Kanade, “Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 2, pp. 139-154, Mar. 1985.
[8] R. Sara, “Finding the Largest Unambiguous Component of Stereo Matching,” Proc. European Conf. Computer Vision, vol. 2, pp. 900-914, 2002.
[9] D. Scharstein and R. Szeliski, “A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms,” Int'l J. Computer Vision, vol. 47, nos. 1-3, pp. 7-42, Apr.-June 2002.
[10] O. Veksler, “Dense Features for Semi-Dense Stereo Correspondence,” Int'l J. Computer Vision, vol. 47, no. 1-3, pp. 247-260, Apr.-June 2002.
[11] O. Veksler, “Extracting Dense Features for Visual Correspondence with Graph Cuts,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, June 2003.

Index Terms:
Stereo, dynamic programming.
Citation:
Minglun Gong, Yee-Hong Yang, "Fast Unambiguous Stereo Matching Using Reliability-Based Dynamic Programming," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 6, pp. 998-1003, June 2005, doi:10.1109/TPAMI.2005.120
Usage of this product signifies your acceptance of the Terms of Use.