Acta Geodaetica et Cartographica Sinica ›› 2020, Vol. 49 ›› Issue (2): 181-190.doi: 10.11947/j.AGCS.2020.20180459

• Photogrammetry and Remote Sensing • Previous Articles     Next Articles

A GPU-PatchMatch multi-view dense matching algorithm based on parallel propagation

DENG Fei1,2, YAN Qingsong1, XIAO Teng1   

  1. 1. School of Geodesy and Geomatics, Wuhan University, Wuhan 430079, China;
    2. Key Laboratory of Urban Land Resources Monitoring and Simulation, MNR, Shenzhen 518000, China
  • Received:2018-10-10 Revised:2019-06-15 Published:2020-03-03
  • Supported by:
    The Open Fund of Key Laboratory of Urban Land Resources Monitoring and Simulation, MNR (No. KF-2018-03-025)

Abstract: Aiming at the problem of low efficiency of multi-view dense matching, a GPU-PatchMatch multi-view dense matching algorithm is proposed. The algorithm uses GPU to improve the computational efficiency of PatchMatch. At the same time, it also makes full use of sparse scene information to initialize the depth information. In addition, in order to improve the propagation efficiency, it uses the pyramid red-blackboard to propagate the depth information in parallel. Finally, the experiments are carried out on the DTU, Strecha and Vaihigen datasets, and compared with the commonly used multi-view dense matching algorithms. The results show that our algorithm has a significant improvement in reconstruction efficiency, which is 7 times higher than the CPU algorithm (such as PMVS, MVE and OpenMVS), and 2.5 times higher than the GPU algorithm (such as Gipuma), which proves the effectiveness of the proposed method.

Key words: 3D reconstruction, multi-view dense matching, PatchMatch, parallel computation

CLC Number: