DPG-Net: Densely progressive-growing network for point cloud completion

被引:6
作者
Li, Jun [1 ,2 ]
Guo, Shangwei [1 ,2 ]
Meng, Xiantong [1 ,2 ]
Lai, ZhengChao [1 ,2 ]
Han, Shaokun [1 ,2 ]
机构
[1] Beijing Inst Technol, Beijing Key Lab Precis Optoelect Measurement Inst, Beijing 100081, Peoples R China
[2] Beijing Inst Technol, Sch Opt & Photon, Beijing 100081, Peoples R China
关键词
Point completion network; 3D point cloud; Shape completion; Deep learning; Generative adversarial network; STEREOLITHOGRAPHY FILE ERRORS; REPAIR;
D O I
10.1016/j.neucom.2022.03.060
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a Densely Progressive-growing Network (DPG-Net) for 3D point cloud completion based on the Generative Adversarial Network (GAN). It aims to learn useful features from incomplete 3D objects to infer the complete geometric shape. Most methods usually acquire global features directly from the incomplete point cloud. However, the global feature often loses local information from the input point cloud. To solve this problem, we design a novel network named DPG-Net for point cloud completion by proposing a multi-resolution dense contextual feature mechanism, a progressive growth process, and combining the adversarial process. Firstly, we study a Multi-resolution Densely Contextual Encoder to infer the potential features with local information of the partial point cloud. The encoder can obtain the global information of the point cloud while fusing the local structure details. Secondly, we propose a Progressive Growth Decoder, which can make full use of global information, to gradually refine local areas and generate a complete shape. In addition, the discriminator is used to control the network for a realistic point cloud. Our model composed of the above modules can extract the features from incom-plete point clouds, and then generate detailed complete point clouds. The performance (chamfer dis-tance) of the proposed method is better than other methods on different datasets. The experiment proves the effectiveness of our method on point cloud completion. (c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 13
页数:13
相关论文
共 60 条
[1]  
Achlioptas P, 2018, PR MACH LEARN RES, V80
[2]  
[Anonymous], 2018, P EUROPEAN WORKSHOPS
[3]   COMPUTING DIRICHLET TESSELLATIONS [J].
BOWYER, A .
COMPUTER JOURNAL, 1981, 24 (02) :162-166
[4]  
Chen C.C., 2005, P INT S INT SIGN PRO, P13
[5]   Multi-View 3D Object Detection Network for Autonomous Driving [J].
Chen, Xiaozhi ;
Ma, Huimin ;
Wan, Ji ;
Li, Bo ;
Xia, Tian .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :6526-6534
[6]  
Clevert D.-A., 2016, C TRACK P, P1
[7]   Geometric attentional dynamic graph convolutional neural networks for point cloud analysis [J].
Cui, Yiming ;
Liu, Xin ;
Liu, Hongmin ;
Zhang, Jiyong ;
Zare, Alina ;
Fan, Bin .
NEUROCOMPUTING, 2021, 432 :300-310
[8]   Shape Completion using 3D-Encoder-Predictor CNNs and Shape Synthesis [J].
Dai, Angela ;
Qi, Charles Ruizhongtai ;
Niessner, Matthias .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :6545-6554
[9]   A Bayesian method for probable surface reconstruction and decimation [J].
Diebel, JR ;
Thrun, S ;
Brünig, M .
ACM TRANSACTIONS ON GRAPHICS, 2006, 25 (01) :39-59
[10]   A Field Model for Repairing 3D Shapes [J].
Duc Thanh Nguyen ;
Hua, Binh-Son ;
Minh-Khoi Tran ;
Quang-Hieu Pham ;
Yeung, Sai-Kit .
2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2016, :5676-5684