Segment-based adaptive window and multi-feature fusion for stereo matching

As to the problems of local stereo matching methods, such as matching window selection difficulty, fuzzy disparity edges and low accuracy in weak texture regions, this paper proposes an efficient stereo matching algorithm to improve the stereo matching accuracy in these regions. First of all, we segment the stereo images and calculate the adaptive support window according to the area of each segmentation region. Second, the matching cost is computed based on the feature fusion of color and gradient, and then the initial disparity can be achieved. Finally, the ultimate matching disparity can be obtained through a series post-processing, including consistency checking, mismatch correcting, disparity refinement and so on. Test results of Middlebury Stereo Datasets show that the proposed algorithm is effective with high matching precision, and especially can tackle well with the weak texture and slope surfaces regions.

[1]  Gauthier Lafruit,et al.  Cross-Based Local Stereo Matching Using Orthogonal Integral Images , 2009, IEEE Transactions on Circuits and Systems for Video Technology.

[2]  Zhou Xiu.  Fast Stereo Matching Using Adaptive Window , 2006 .

[3]  In-So Kweon,et al.  Adaptive Support-Weight Approach for Correspondence Search , 2006, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Qican Zhang,et al.  Local stereo matching with adaptive support-weight, rank transform and disparity calibration , 2008, Pattern Recognit. Lett..

[5]  Ramin Zabih,et al.  Dynamic Programming and Graph Algorithms in Computer Vision , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Zheng Zhi.  A Region Based Stereo Matching Algorithm Using Cooperative Optimization , 2009 .

[7]  Olga Veksler,et al.  Fast variable window for stereo correspondence using integral images , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[8]  Minh N. Do,et al.  A revisit to cost aggregation in stereo matching: How far can we reduce its computational redundancy? , 2011, 2011 International Conference on Computer Vision.

[9]  Harry Shum,et al.  Stereo computation using radial adaptive windows , 2002, Object recognition supported by user interaction for service robots.

[10]  Katsushi Ikeuchi,et al.  Interactive Shadow Removal from a Single Image Using Hierarchical Graph Cut , 2009, ACCV.

[11]  Yo-Sung Ho,et al.  Advances in Image and Video Technology , 2011, Lecture Notes in Computer Science.

[12]  Zhang Qi.  Stereo Matching Algorithm of Adaptive Window Based on Gradient , 2012 .

[13]  Olga Veksler,et al.  Stereo correspondence by dynamic programming on a tree , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[14]  Xiaoyan Yu,et al.  Multi-Pattern Stereo Matching with Intensity-Weighted Correlation , 2012 .

[15]  Sing Bing Kang,et al.  Stereo for Image-Based Rendering using Image Over-Segmentation , 2007, International Journal of Computer Vision.

[16]  Kwanghoon Sohn,et al.  Cost Aggregation and Occlusion Handling With WLS in Stereo Matching , 2008, IEEE Transactions on Image Processing.

[17]  Takeshi Naemura,et al.  Graph Cut Based Continuous Stereo Matching Using Locally Shared Labels , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[18]  Wen Gao,et al.  Local Stereo Matching with Improved Matching Cost and Disparity Refinement , 2014, IEEE MultiMedia.

[19]  Kuk-Jin Yoon,et al.  Locally adaptive support-weight approach for visual correspondence search , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[20]  Andreas Klaus,et al.  Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[21]  Vamshhi Pavan Kumar Varma Vegeshna,et al.  Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[22]  Rafael Cabeza,et al.  Stereo matching using gradient similarity and locally adaptive support-weight , 2011, Pattern Recognit. Lett..

[23]  Margrit Gelautz,et al.  Secrets of adaptive support weight techniques for local stereo matching , 2013, Comput. Vis. Image Underst..

[24]  Vladimir Kolmogorov,et al.  Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[25]  Federico Tombari,et al.  Segmentation-Based Adaptive Support for Accurate Stereo Correspondence , 2007, PSIVT.

[26]  Olga Veksler,et al.  Stereo Correspondence with Compact Windows via Minimum Ratio Cycle , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  Yi Deng,et al.  A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming , 2006, ECCV.

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

[29]  Soumik Ukil,et al.  Robust segment-based Stereo using Cost Aggregation , 2014, BMVC.

[30]  Emanuele Trucco,et al.  Efficient stereo with multiple windowing , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.