Density-Adaptive and Geometry-Aware Registration of TLS Point Clouds Based on Coherent Point Drift

被引:7
作者
Zang, Yufu [1 ,2 ]
Lindenbergh, Roderik [2 ]
Yang, Bisheng [3 ]
Guan, Haiyan [1 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Sch Remote Sensing & Geomat Engn, Nanjing 210044, Peoples R China
[2] Delft Univ Technol, Dept Geosci & Remote Sensing, NL-2628 Delft, Netherlands
[3] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Peoples R China
基金
美国国家科学基金会;
关键词
Three-dimensional displays; Probabilistic logic; Geometry; Remote sensing; Feature extraction; Robustness; Approximation algorithms; Coherent point drift (CPD); density variations; global registration; matching probability matrix; structural constraints; AUTOMATIC REGISTRATION; ALGORITHM;
D O I
10.1109/LGRS.2019.2950128
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
Probabilistic registration algorithms [e.g., coherent point drift, (CPD)] provide effective solutions for point cloud alignment. However, using the original CPD algorithm for automatic registration of terrestrial laser scanner (TLS) point clouds is highly challenging because of density variations caused by scanning acquisition geometry. In this letter, we propose a new global registration method, introducing the use of the CPD framework for TLS point clouds. We first consider the measurement geometry and the intrinsic characteristics of the scene to simplify points. In addition to the Euclidean distance, we incorporate geometric information as well as structural constraints in the probabilistic model to optimize the so-called matching probability matrix. Among the structural constraints, we use a spectral graph to measure the structural similarity between matches at each iteration. The method is tested on three data sets collected by different TLS scanners. Experimental results demonstrate that the proposed method is robust to density variations and can decrease iterations effectively. The average registration errors of the three data sets are 0.05, 0.12, and 0.08 m, respectively. It is also shown that our registration framework is superior to the state-of-the-art methods in terms of both registration errors and efficiency. The experiments demonstrate the effectiveness and efficiency of the proposed probabilistic global registration.
引用
收藏
页码:1628 / 1632
页数:5
相关论文
共 24 条
[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]   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
[3]   An Adaptive Data Representation for Robust Point-Set Registration and Merging [J].
Campbell, Dylan ;
Petersson, Lars .
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, :4292-4300
[4]   OBJECT MODELING BY REGISTRATION OF MULTIPLE RANGE IMAGES [J].
CHEN, Y ;
MEDIONI, G .
IMAGE AND VISION COMPUTING, 1992, 10 (03) :145-155
[5]   A novel binary shape context for 3D local surface description [J].
Dong, Zhen ;
Yang, Bisheng ;
Liu, Yuan ;
Liang, Fuxun ;
Li, Bijun ;
Zang, Yufu .
ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 2017, 130 :431-452
[6]  
Fontanelli D, 2007, IEEE INT CON AUTO SC, P963
[7]   An automatic registration algorithm for the scattered point clouds based on the curvature feature [J].
He, Bingwei ;
Lin, Zeming ;
Li, Y. F. .
OPTICS AND LASER TECHNOLOGY, 2013, 46 :53-60
[8]  
Hong H, 2017, IEEE INT C INT ROBOT, P3333, DOI 10.1109/IROS.2017.8206170
[9]   Heritage site preservation with combined radiometric and geometric analysis of TLS data [J].
Javier Sanchez-Aparicio, Luis ;
Del Pozo, Susana ;
Ramos, Luis F. ;
Arce, Andres ;
Fernandes, Francisco M. .
AUTOMATION IN CONSTRUCTION, 2018, 85 :24-39
[10]   A Robust Image Matching Method based on Optimized BaySAC [J].
Kang, Zhizhong ;
Jia, Fengman ;
Zhang, Liqiang .
PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, 2014, 80 (11) :1041-1052