Computer Science ›› 2019, Vol. 46 ›› Issue (11A): 241-245.

• Pattern Recognition & Image Processing • Previous Articles     Next Articles

Implementation and Application of Stereo Matching Method Based onImproved Multi-weight Sliding Window

DU Juan, SHEN Si-yun   

  1. (South China University of Technology,Guangzhou 510641,China)
  • Online:2019-11-10 Published:2019-11-20

Abstract: The key problem of stereo vision is to obtain accurate disparity values through stereo matching algorithms.However,most existing stereo matching algorithms are unable to obtain accurate and correct disparities in low-texture regions.In this paper,in order to solve the problems of low matching accuracy of low texture regions and large computational complexity of high-precision semi-global matching algorithm,a stereo matching algorithm based on adaptive sliding window was proposed.The cost volume is calculated by AD-Census transform firstly.The shape of the aggregate window and the weight of the pixels are adjusted for different regions.The cross-scale cost aggregation framework conforming to the human visual feature is used to obtain the aggregate cost volume.Finally,the “winner take all strategy” is used to obtain the final disparity maps.Experiments show that the mismatch rate of the algorithm in low-texture regions decrease form 5.8% to 21.68%,which is lower than that of the traditional scheme,and the computation time is shorter than the semi-global algorithm.

Key words: Adaptive sliding window, AD-Census transform, Gaussian pyramid, Stereo matching

CLC Number: 

  • TP391
[1]YANG Q,WANG L,YANG R,et al.Stereo Matching with Color-Weighted Correlation,Hierachical Belief Propagation and Occlusion Handling[C]∥IEEE Computer Society Conference on Computer Vision & Pattern Recognition.IEEE Computer Society,2006.
[2]HONG L,CHEN G.Segment-Based Stereo Matching UsingGraph Cuts[C]∥null.IEEE Computer Society,2004.
[3]HIRSCHM H.Stereo Processing by Semi-global Matching and Mutual Information[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2007,30(2):328-341.
[4]ŽBONTAR,JURE,LECUN Y.Computing the Stereo Matching Cost with a Convolutional Neural Network[J].Computer Vision and Pattern Recognition,2014.
[5]YANG Q.Stereo Matching Using Tree Filtering[J].IEEETransactions on Pattern Analysis & Machine Intelligence,2015.
[6]HE K,JIAN S,TANG X.Guided Image Filtering[M]∥Computer Vision- ECCV 2010.2010.
[7]KANADE T,OKUTOMI M.A stereo matching algorithm with an adaptive window:theory and experiment[C]∥IEEE International Conference on Robotics & Automation.IEEE,2002.
[8]ZABIH R,WOODFILL J.Non-parametric Local Transforms for Computing Visual Correspondence[J].Proc.third European Conf.computer Vision,1994:151-158.
[9]SHEN Y.Efficient normalized cross correlation calculationmethod for stereo vision based robot navigation[J].中国计算机科学前沿:英文版,2011,5(2):227-235.
[10]KIM J,KOLMOGORO V,ZABI H.Visual correspondence using energy minimization and mutual information[C]∥Proceedings Ninth IEEE International Conference on Computer Vision.IEEE,2008.
[11]SCHARSTEIN D,SZELISKI R.A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms[J].International Journal of Computer Vision,2002,47(1/3):7-42.
[12]VEKSLER O.Fast variable window for stereo correspondence using integral images[C]∥2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition,2003.IEEE,2003.
[13]YOON K J,KWEON I S.Adaptive Support-Weight Approach for Correspondence Search[J].IEEE Trans Pattern Anal Mach Intell,2006.
[14]ZHANG K,LU J,LAFUIT G.Cross-Based Local Stereo Matching Using Orthogonal Integral Images[J].IEEE Transactions on Circuits and Systems for Video Technology,2009,19(7):1073-1079.
[15]YANG Q.A non-local cost aggregation method for stereo matching[C]∥2012 IEEE Conference on Computer Vision and Pattern Recognition.IEEE Computer Society,2012.
[16]MEI X,SUN X,DONG W,et al.Segment-Tree Based Cost Aggregation for Stereo Matching[C]∥IEEE Conference on Computer Vision and Pattern Recognition.IEEE,2013.
[17]MEI X,SUN X,ZHOU M,et al.On building an accurate stereo matching system on graphics hardware[C]∥IEEE International Conference on Computer Vision Workshops.2012.
[18]LOWE D G.Distinctive Image Features from Scale-InvariantKeypoints[J].International Journal of Computer Vision,2004,60(2):91-110.
[19]ZHANG K,FANG Y,MIN D,et al.Cross-Scale Cost Aggregation for Stereo Matching[C]∥Computer Vision & Pattern Recognition.IEEE,2014.
[1] ZHANG Peng, WANG Xin-qing, XIAO Yi, DUAN Bao-guo, XU Hong-hui. Real-time Binocular Depth Estimation Algorithm Based on Semantic Edge Drive [J]. Computer Science, 2021, 48(9): 216-222.
[2] CAO Lin, YU Wei-wei. Adaptive Window Binocular Stereo Matching Algorithm Based on Image Segmentation [J]. Computer Science, 2021, 48(11A): 314-318.
[3] SANG Miao-miao, PENG Jin-xian, DA Tong-hang, ZHANG Xu-feng. Efficient Semi-global Binocular Stereo Matching Algorithm Based on PatchMatch [J]. Computer Science, 2021, 48(1): 204-208.
[4] ZHU Ling-ying, SANG Qing-bing, GU Ting-ting. No-reference Stereo Image Quality Assessment Based on Disparity Information [J]. Computer Science, 2020, 47(9): 150-156.
[5] LI Yin-guo, ZHOU Zhong-kui, BAI Ling. Large-scale Automatic Driving Scene Reconstruction Based on Binocular Image [J]. Computer Science, 2019, 46(11A): 251-254.
[6] JIANG Ze-tao, WANG Qi, ZHAO Yan. Stereo Matching Algorithm Based on Adaptive Support Weight Optimization [J]. Computer Science, 2018, 45(8): 242-246.
[7] ZHANG Yan-feng,HUANG Xiang-sheng,LI Hang and WANG Meng-wei. Fast Stereo Matching Based on Progressive Reliable Point Growing Matching for Speckle Pattern Images [J]. Computer Science, 2014, 41(Z6): 143-146.
[8] . Adaptive Multiple Windows Stereo Matching Algorithm [J]. Computer Science, 2012, 39(Z6): 519-521.
[9] HU Yan,GENG Guo-hua,ZHOU Ming-quan,WANG Xiao-feng`. Stereo Matching Algorithm Based on Uncalibrated Color Images for 3D Reconstruction [J]. Computer Science, 2011, 38(7): 277-279.
[10] . [J]. Computer Science, 2009, 36(2): 190-193.
[11] LU Si-jun,TANG Zhen-min,GUO Long-yuan,LU A-li. Research on Binocular Stereo Matching in the Presence of Specular Reflections [J]. Computer Science, 2009, 36(11): 266-268.
[12] CHEN Wang,ZHANG Mao-jun,XIONG Zhi-hui. Dense Matching Algorithm Based on Region Boundary Restriction via Graph Cuts Optimization [J]. Computer Science, 2009, 36(11): 258-261.
[13] LU A-Li, TANG Zhen-Min ,YANG Jing-Yu (Department of Computer Science & Technology , Nanjing University of Science and Technology , Nanjing 210094). [J]. Computer Science, 2008, 35(4): 186-189.
[14] . [J]. Computer Science, 2008, 35(11): 217-219.
[15] . [J]. Computer Science, 2007, 34(4): 239-240.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!