Edge-Preserving Stereo Matching Using Minimum Spanning Tree

被引:5
|
作者
Zhang, Congxuan [1 ]
He, Chao [2 ]
Chen, Zhen [1 ]
Liu, Wen [3 ]
Li, Ming [1 ]
Wu, Junjie [1 ]
机构
[1] Nanchang Hangkong Univ, Key Lab Nondestruct Testing, Minist Educ, Nanchang 330063, Jiangxi, Peoples R China
[2] Nanjing Univ Aeronaut & Astronaut, Sch Automat, Nanjing 211106, Peoples R China
[3] Univ Kansas, Dept Phys Therapy & Rehabil Sci, Kansas City, KS 66160 USA
来源
IEEE ACCESS | 2019年 / 7卷
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Stereo matching; minimum spanning tree; edge-preserving; brightness information; disparity range estimation; segmentation optimization; SUPPORT-WEIGHT APPROACH; COST AGGREGATION; ACCURATE;
D O I
10.1109/ACCESS.2019.2958527
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Despite that the accuracy and efficiency of stereo matching technology have significantly improved in the past decades, the issue of edge-blurring remains a challenge to most of the existing approaches. In this paper, we propose a minimum spanning tree (MST) based stereo matching method by using the image edge and segmentation optimization to preserve the image boundary. We first exploit a fast disparity range estimation method by combining the Surf and Akaze feature points to improve the computational efficiency. Second, we utilize the image edges and brightness information to generate a self-adaptive weight function, which is able to significantly improve the accuracy of MST aggregating in the regions of complex texture and boundaries with similar color distribution. Third, we employ the image segmentation to extract the invalid regions of the estimated disparity map, and propose a post-processing scheme to refine the disparity result. Finally, we run our method on several Middlebury and KITTI datasets. The comparison results between our method and other state-of-the-art approaches demonstrate that the proposed method has high accuracy for disparity computation and is especially robust to the edge-blurring.
引用
收藏
页码:177909 / 177921
页数:13
相关论文
共 50 条
  • [31] Finding the Shortest Bottleneck Edge in a Parametric Minimum Spanning Tree
    Chan, Timothy M.
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 917 - 918
  • [32] Segmentation and edge-preserving restoration
    Teboul, S
    BlancFeraud, L
    Aubert, G
    Barlaud, M
    INTERNATIONAL CONFERENCE ON IMAGE PROCESSING - PROCEEDINGS, VOL II, 1997, : 470 - 473
  • [33] EDGE-PRESERVING SMOOTHING USING THE FUZZY CONTROL TECHNIQUE
    TAKASHIMA, H
    TAGUCHI, A
    MURATA, Y
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1995, 78 (01): : 32 - 43
  • [34] Multiresolution image fusion using edge-preserving filters
    Upla, Kishor P.
    Joshi, Sharad
    Joshi, Manjunath V.
    Gajjar, Prakash P.
    JOURNAL OF APPLIED REMOTE SENSING, 2015, 9
  • [35] Stereo Matching Using Tree Filtering
    Yang, Qingxiong
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2015, 37 (04) : 834 - 846
  • [36] Speckle reduction with edge-preserving
    Mathieu, P
    Dirat, L
    Dupuis, X
    Barlaud, M
    1997 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I - V: VOL I: PLENARY, EXPERT SUMMARIES, SPECIAL, AUDIO, UNDERWATER ACOUSTICS, VLSI; VOL II: SPEECH PROCESSING; VOL III: SPEECH PROCESSING, DIGITAL SIGNAL PROCESSING; VOL IV: MULTIDIMENSIONAL SIGNAL PROCESSING, NEURAL NETWORKS - VOL V: STATISTICAL SIGNAL AND ARRAY PROCESSING, APPLICATIONS, 1997, : 2785 - 2788
  • [37] SVM for Edge-Preserving Filtering
    Yang, Qingxiong
    Wang, Shengnan
    Ahuja, Narendra
    2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2010, : 1775 - 1782
  • [38] Edge-Preserving Laplacian Pyramid
    Yu, Stella X.
    ADVANCES IN VISUAL COMPUTING, PT 1, PROCEEDINGS, 2009, 5875 : 307 - 316
  • [39] EDGE-PRESERVING AND PEAK-PRESERVING SMOOTHING
    HALL, P
    TITTERINGTON, DM
    TECHNOMETRICS, 1992, 34 (04) : 429 - 440
  • [40] An edge-preserving image reconstruction using neural network
    Bao, P
    Wang, DH
    JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2001, 14 (02) : 117 - 130