Rethinking 3D cost aggregation in stereo matching

被引:6
|
作者
Gan, Wanshui [1 ,3 ]
Wu, Wenhao [2 ]
Chen, Shifeng [1 ]
Zhao, Yuxiang [1 ]
Wong, Pak Kin [3 ]
机构
[1] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China
[2] Baidu Inc, Dept Comp vis Technol VIS, Beijing, Peoples R China
[3] Univ Macau, Dept Electromech Engn, Macau, Peoples R China
关键词
Stereo matching; Disparity estimation; Shift operation; 3D Convolution;
D O I
10.1016/j.patrec.2023.02.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the stereo matching task, the 3D convolution network can effectively aggregate the cost volume with the strong representation ability to model the spatial and depth dimensions but with the disadvantage of a high computational cost. In this letter, we revisit the 3D convolution network and its common variant, and then propose the Depth Shift Module (DSM) to model the cost volume in the depth dimension which could imitate the 3D convolution function with the computational complexity of the 2D convolution. The proposed DSM is easy to extend to present 3D cost aggregation methods in stereo matching with less inference time, lower computational complexity, and minor precision loss. Moreover, a novel compact but efficient stereo matching framework named HybridNet is proposed. This framework can hybridize the 2D convolution layer with the proposed DSM to effectively aggregate the cost volume. The proposed HybridNet achieves a better trade-off between the performance, computational complexity, and model size (e.g., 30% less than the size of AANet and 25% less than the size of PSMNet) in public open-source datasets (e.g., Scene Flow and KITTI Stereo 2015). The relevant code is available at https://github.com/ GANWANSHUI/HybridNet .(c) 2023 Published by Elsevier B.V.
引用
收藏
页码:75 / 81
页数:7
相关论文
共 50 条
  • [1] 3D cost aggregation with multiple minimum spanning trees for stereo matching
    Li, Lincheng
    Yu, Xin
    Zhang, Shunli
    Zhao, Xiaolin
    Zhang, Li
    APPLIED OPTICS, 2017, 56 (12) : 3411 - 3420
  • [2] Local Stereo Matching with 3D Adaptive Cost Aggregation for Slanted Surface Modeling and Sub-pixel Accuracy
    Zhang, Yilei
    Gong, Minglun
    Yang, Yee-Hong
    19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, : 628 - +
  • [3] 3D LiDAR and Stereo Fusion using Stereo Matching Network with Conditional Cost Volume Normalization
    Wang, Tsun-Hsuan
    Hu, Hou-Ning
    Lin, Chieh Hubert
    Tsai, Yi-Hsuan
    Chiu, Wei-Chen
    Sun, Min
    2019 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2019, : 5895 - 5902
  • [4] Stereo Matching Algorithms with Different Cost Aggregation
    Ning, Kelin
    Zhang, Xiaoying
    Ming, Yue
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (CSAIT 2013), 2014, 255 : 647 - 653
  • [5] Hybrid cost aggregation for dense stereo matching
    Yao, Ming
    Ouyang, Wenbin
    Xu, Bugao
    MULTIMEDIA TOOLS AND APPLICATIONS, 2020, 79 (31-32) : 23189 - 23202
  • [6] CONVOLUTIONAL COST AGGREGATION FOR ROBUST STEREO MATCHING
    Jeong, Somi
    Kim, Seungryong
    Ham, Bumsub
    Sohn, Kwanghoon
    2017 24TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2017, : 2523 - 2527
  • [7] Hybrid cost aggregation for dense stereo matching
    Ming Yao
    Wenbin Ouyang
    Bugao Xu
    Multimedia Tools and Applications, 2020, 79 : 23189 - 23202
  • [8] Stereo Matching for 3D Building Reconstruction
    Gupta, Gaurav
    Balasubramanian, R.
    Rawat, M. S.
    Bhargava, R.
    Krishna, B. Gopala
    ADVANCES IN COMPUTING, COMMUNICATION AND CONTROL, 2011, 125 : 522 - +
  • [9] Local stereo matching using combined matching cost and adaptive cost aggregation
    Zhu, Shiping
    Li, Zheng
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2015, 9 (01): : 224 - 241
  • [10] Fast Local Stereo Matching with Effective Matching Cost and Robust Cost Aggregation
    Zhu, Zhengrong
    Lei, Xiaoyong
    IECON 2017 - 43RD ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, 2017, : 3304 - 3309