Acta Optica Sinica, Volume. 39, Issue 11, 1115001(2019)

Stereo Matching Algorithm Based on Three-Dimensional Convolutional Neural Network

Yufeng Wang1,2, Hongwei Wang2,3、**, Guang Yu2, Mingquan Yang2, Yuwei Yuan4, and Jicheng Quan1,2、*
Author Affiliations
  • 1Naval Aviation University, Yantai, Shandong 264001, China
  • 2Aviation University of Air Force, Changchun, Jilin 130022, China
  • 3Information Engineering University, Zhengzhou, Henan 450001, China
  • 4The 91977 Troops, Beijing 102200, China
  • show less

    For a stereo matching method based on deep learning, network architecture is critical to ensuring the algorithm's accuracy; efficiency is also an important factor to consider in practical applications. A stereo matching method with a sparse cost volume in the disparity dimension is proposed herein. The three-dimensional sparse cost volume is created by shifting right-view features with a large step to substantially reduce the memory and computational resources in a three-dimensional convolution module. The matching cost is nonlinearly sampled via multiclass output in the disparity dimension, and the model is trained by merging two types of loss functions, such that the proposed method's accuracy is improved without any notable reduction in efficiency. The proposed algorithm reduces running time by about 40% while improving accuracy compared with the benchmark algorithm on the KITTI test dataset.

    Tools

    Get Citation

    Copy Citation Text

    Yufeng Wang, Hongwei Wang, Guang Yu, Mingquan Yang, Yuwei Yuan, Jicheng Quan. Stereo Matching Algorithm Based on Three-Dimensional Convolutional Neural Network[J]. Acta Optica Sinica, 2019, 39(11): 1115001

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category: Machine Vision

    Received: May. 5, 2019

    Accepted: Jul. 8, 2019

    Published Online: Nov. 6, 2019

    The Author Email: Wang Hongwei (alex19820911@126.com), Quan Jicheng (jicheng_quan@126.com)

    DOI:10.3788/AOS201939.1115001

    Topics