Rapid registration method by using partial 3D point clouds

被引:12
作者
Xin, Meiting [1 ]
Li, Bing [1 ,2 ]
Wei, Xiang [1 ]
Zhao, Zhuo [1 ]
机构
[1] Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xianning West Rd, Xian 710049, Shaanxi, Peoples R China
[2] Xi An Jiao Tong Univ, Int Joint Res Lab Micronano Mfg & Measurement Tec, Xianning West Rd, Xian 710049, Shaanxi, Peoples R China
来源
OPTIK | 2021年 / 246卷
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Point cloud; Registration; Principal component analysis; Eigenvalue analysis; Iterative closest point; LOCALIZATION; DESCRIPTORS; ALIGNMENT; SETS;
D O I
10.1016/j.ijleo.2021.167764
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Due to the rapid development of three-dimensional laser technique, the registration algorithm attracts more attention in industrial application. In this paper, a rapid registration method of 3D point clouds is proposed to improve the efficiency of reverse engineering. The method is based on weighted principal analysis method and re-weighted iterative closest point algorithm. The pipeline consists three stages: coarse alignment, data simplification, and fine alignment. During the first phase, a weighted principal component analysis method is used to calculate original transformation matrices between model data and scene data. In the second part, principal component eigenvalue analysis scheme is implemented to filter the redundant points of datasets. This procedure could reduce the input number of fine registration and refine outliers. Finally, the fine registration is obtained by a weighted iterative closest point algorithm based on Cauchy's and Welsch's function using the partial points obtained in the second phase. The experimental results and comparison experiments are utilized to demonstrate the validity and effectiveness of the proposed matching algorithm.
引用
收藏
页数:12
相关论文
共 31 条
[1]   4-points congruent sets for robust pairwise surface registration [J].
Aiger, Dror ;
Mitra, Niloy J. ;
Cohen-Or, Daniel .
ACM TRANSACTIONS ON GRAPHICS, 2008, 27 (03)
[2]  
Arik I., 2014, INT J AGRIC STAT SCI, V10, P7
[3]  
Besl P. J., 1992, PROC SENSOR FUSION 4, P586, DOI DOI 10.1117/12.57955
[4]  
BESL PJ, 1992, P SOC PHOTO-OPT INS, V1611, P586, DOI 10.1117/12.57955
[5]   Sparse Iterative Closest Point [J].
Bouaziz, Sofien ;
Tagliasacchi, Andrea ;
Pauly, Mark .
COMPUTER GRAPHICS FORUM, 2013, 32 (05) :113-123
[6]   Automatic point cloud coarse registration using geometric keypoint descriptors for indoor scenes [J].
Bueno, M. ;
Gonzalez-Jorge, H. ;
Martinez-Sanchez, J. ;
Lorenzo, H. .
AUTOMATION IN CONSTRUCTION, 2017, 81 :134-148
[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]   A Qualitative Review on 3D Coarse Registration Methods [J].
Diez, Yago ;
Roure, Ferran ;
Llado, Xavier ;
Salvi, Joaquim .
ACM COMPUTING SURVEYS, 2015, 47 (03)
[9]   Continuous mapping and localization for autonomous navigation in rough terrain using a 3D laser scanner [J].
Droeschel, David ;
Schwarz, Max ;
Behnke, Sven .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2017, 88 :104-115
[10]   HGMR: Hierarchical Gaussian Mixtures for Adaptive 3D Registration [J].
Eckart, Benjamin ;
Kim, Kihwan ;
Kautz, Jan .
COMPUTER VISION - ECCV 2018, PT 15, 2018, 11219 :730-746