A Dynamic Programming Approach Based Stereo Vision Algorithm Improving Object Border Performance

The key issue of stereo vision algorithm using dynamic programming approach is to establish the cost function. Normally the cost of a match is the matching difference or matching error. This is almost the same for different algorithms in this approach. The only difference is in the cost of occlusion. Actually the cost of a known occluded point should be zero, because it is a good match. The difficulty is how to find the occluded region. In this paper, we present a new algorithm in which we first find the occluded region in the image using correlation approach. Then we establish a cost function in which the cost of the occluded region is set to zero. Then we use dynamic programming approach to minimize the energy of this cost function. Experimental results show that this algorithm can achieve excellent results with acceptable time efficiency

[1]  Jun Zhao,et al.  A Fast Stereo Vision Algorithm With Improved Performance at Object Borders , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[2]  J.C. Alvarez,et al.  Fast stereo vision algorithm for robotic applications , 1999, 1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467).

[3]  Maarten Vergauwen,et al.  A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming , 2002, International Journal of Computer Vision.

[4]  Carlo Tomasi,et al.  Depth Discontinuities by Pixel-to-Pixel Stereo , 1999, International Journal of Computer Vision.

[5]  Jonathan M. Garibaldi,et al.  Real-Time Correlation-Based Stereo Vision with Reduced Border Errors , 2002, International Journal of Computer Vision.

[6]  Takeo Kanade,et al.  Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  D. Scharstein,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001).

[8]  Andrew Blake,et al.  Bi-layer segmentation of binocular stereo video , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[9]  Luigi di Stefano,et al.  A fast area-based stereo matching algorithm , 2004, Image Vis. Comput..

[10]  Andrew Blake,et al.  Gaze manipulation for one-to-one teleconferencing , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.