Gaussian Mixture Model-Based Registration Network for Point Clouds with Partial Overlap

被引:1
作者
Li, Xiang [1 ]
Sun, Jianwen [2 ]
Own, Chung-Ming [1 ]
Tao, Wenyuan [1 ]
机构
[1] Tianjin Univ, Tianjin, Peoples R China
[2] Tianjin Univ Technol, Tianjin, Peoples R China
来源
ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2022, PT III | 2022年 / 13531卷
关键词
Point cloud registration; Registration network; Gaussian mixture model;
D O I
10.1007/978-3-031-15934-3_34
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Mainstream methods of point cloud registration can be divided into two categories: strict point-level correspondence, which is commonly used but incompatible with real-world data; and statistical calculations, which compensate for the shortcomings of point-level methods but are inflexible, mainly when applied to scenes containing partial overlap. This paper proposes a novel registration network (poGMM-Net), the first statistical registration method to successfully align two partially overlapping point clouds. Specifically, our model modifies the registration problem to involve the minimization of Kullback-Leibler divergence in Gaussian mixture models (GMMs), focusing on overlapping regions. In poGMM-Net, the GMMs are associated with points in the point clouds by the learned potential correspondence matrix. The fitting of nonoverlapping points and outliers is avoided by fusing learned secondary feature sets. Application of models to ModelNet40 datasets demonstrated that poGMM-Net achieves state-of-the-art performance under various registration conditions, outperforming both point-level-based and statistical methods.
引用
收藏
页码:405 / 416
页数:12
相关论文
共 26 条
[1]  
[Anonymous], 2012, Pattern Recognition and Machine Learning
[2]  
[Anonymous], 2009, ROBOTICS SCI SYSTEMS
[3]   PointNetLK: Robust & Efficient Point Cloud Registration using PointNet [J].
Aoki, Yasuhiro ;
Goforth, Hunter ;
Srivatsan, Rangaprasad Arun ;
Lucey, Simon .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :7156-7165
[4]   Lucas-Kanade 20 years on: A unifying framework [J].
Baker, S ;
Matthews, I .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2004, 56 (03) :221-255
[5]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[6]   The normal distributions transform: A new approach to laser scan matching [J].
Biber, P .
IROS 2003: PROCEEDINGS OF THE 2003 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, 2003, :2743-2748
[7]   Robust euclidean alignment of 3D point sets: the trimmed iterative closest point algorithm [J].
Chetverikov, D ;
Stepanov, D ;
Krsek, P .
IMAGE AND VISION COMPUTING, 2005, 23 (03) :299-309
[8]  
Colas F., 2015, ROBOT, V4, P1, DOI DOI 10.1561/2300000035
[9]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[10]   Fast Monte-Carlo Localization on Aerial Vehicles using Approximate Continuous Belief Representations [J].
Dhawale, Aditya ;
Shankar, Kumar Shaurya ;
Michael, Nathan .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :5851-5859