OCCLUSION HANDLED BLOCK-BASED STEREO MATCHING WITH IMAGE SEGMENTATION

This paper chiefly deals with techniques of stereo vision, particularly focuses on the procedure of stereo matching. In addition, the proposed approach deals with detection of the regions of occlusion. Prior to carrying out stereo matching, image segmentation is conducted in order to achieve precise matching results. In practice, in stereo vision, matching algorithm sometimes suffers from insufficient accuracy if occlusion is inherent with the scene of interest. Searching the matching regions is conducted based on cross correlation and based on finding a region of the minimum mean square error of the difference between the areas of interest defined in matching window. Middlebury dataset is used for experiments, comparison with the existed results, and the proposed algorithm shows better performance than the existed matching algorithms. To evaluate the proposed algorithm, we compare the result of disparity to the existed ones.

[1]  Shiping Zhu,et al.  Local stereo matching algorithm with efficient matching cost and adaptive guided image filter , 2017, The Visual Computer.

[2]  Joost van de Weijer,et al.  Accurate Stereo Matching by Two-Step Energy Minimization , 2015, IEEE Transactions on Image Processing.

[3]  Darius Burschka,et al.  Advances in Computational Stereo , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Reinhard Männer,et al.  Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation , 2004, International Journal of Computer Vision.

[5]  Luc Van Gool,et al.  Speeded-Up Robust Features (SURF) , 2008, Comput. Vis. Image Underst..

[6]  Zuren Feng,et al.  Occlusion-Aware Stereo Matching , 2016, International Journal of Computer Vision.

[7]  이상욱,et al.  영역 분할에 의한 동적 계획법을 이용한 스테레오 정합 ( Stereo Matching Using Dynamic Programming with Region Partition ) , 1997 .

[8]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[9]  Richard Szeliski,et al.  High-accuracy stereo depth maps using structured light , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[10]  H. Opower.  Multiple view geometry in computer vision , 2002 .

[11]  Abolghasem A. Raie,et al.  Dynamic programming-based dense stereo matching improvement using an efficient search space reduction technique , 2018 .

[12]  Chang-Su Kim,et al.  Adaptive smoothness constraints for efficient stereo matching using texture and edge information , 2016, 2016 IEEE International Conference on Image Processing (ICIP).

[13]  Jian Zhang,et al.  Graph Cuts Stereo Matching Based on Patch-Match and Ground Control Points Constraint , 2015, PCM.

[14]  Richard Szeliski,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.