Segment-based stereo matching using edge dynamic programming

For the weakness of the pixel-based stereo matching, setting segment as a processing element is more practical. This paper presents a new segment-based stereo matching method using edge dynamic programming (DP). Firstly, from the perspective of human stereo vision, the reference image is segmented by an object-oriented segmentation method, which simulates human perceptual process and fully takes shape, spectral and spatial context into account. Secondly, by employing a refined DP algorithm which is based on the inner edgeline of the segment, the typical “streaking” effect is solved effectively. Finally, the final disparity images are obtained. Consistent with human being's vision, this algorithm combines segmentation and refined DP algorithm speeds up stereo matching process while keeping matching results accurate. The experimental results indicate that the algorithm has high matching precision and fast calculating speed.

[1]  K. Faez,et al.  Fast stereo matching using two stage color-based segmentation and dynamic programming , 2009, 2009 6th International Symposium on Mechatronics and its Applications.

[2]  Hai Tao,et al.  Global matching criterion and color segmentation based stereo , 2000, Proceedings Fifth IEEE Workshop on Applications of Computer Vision.

[3]  VekslerOlga,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001 .

[4]  Lorenzo Bruzzone,et al.  A Multilevel Context-Based System for Classification of Very High Spatial Resolution Images , 2006, IEEE Transactions on Geoscience and Remote Sensing.

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

[6]  Nanning Zheng,et al.  Stereo Matching Using Belief Propagation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  L. Hong,et al.  Segment-based stereo matching using graph cuts , 2004, CVPR 2004.

[8]  Jianbin Jiao,et al.  A new segment-based algorithm for stereo matching , 2009, 2009 International Conference on Mechatronics and Automation.

[9]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Aaron F. Bobick,et al.  Large Occlusion Stereo , 1999, International Journal of Computer Vision.

[11]  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).

[12]  Takeo Kanade,et al.  A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[14]  Margrit Gelautz,et al.  A layered stereo matching algorithm using image segmentation and global visibility constraints , 2005 .