A hierarchical multiview registration framework of TLS point clouds based on loop constraint

被引:14
作者
Wu, Hao [1 ]
Yan, Li [1 ]
Xie, Hong [1 ]
Wei, Pengcheng [1 ]
Dai, Jicheng [1 ]
机构
[1] Wuhan Univ, Sch Geodesy & Geomat, 129 Luoyu Rd, Wuhan 430079, Peoples R China
关键词
Point cloud registration; Hierarchical registration; Multiple overlaps; Loop constraint; False matches removal; SCAN REGISTRATION; AUTOMATIC REGISTRATION; RANGE IMAGES; 3D; SURFACE; HISTOGRAMS; ACCURATE; SETS;
D O I
10.1016/j.isprsjprs.2022.11.004
中图分类号
P9 [自然地理学];
学科分类号
0705 ; 070501 ;
摘要
Automatic registration of multiple point clouds is a significant preprocessing step for 3D computer vision tasks including semantic segmentation, 3D modelling, change detection, etc. Many methods were proposed to deal with this problem and yet most of them are not fully utilizing the redundant information offered by multiple common overlaps among point clouds. The existing methods are also inefficient when dealing with large-scale point clouds. In this paper, a novel automatic registration framework is presented to align point clouds efficiently and robustly. First, the overall number of scans is grouped into several scan-blocks by a proposed blocking strategy, and we build the pairwise relationship among scans through a fully connected graph in each scan-block. Second, perform loop-based coarse registration in each scan-block using a proposed false matches removal strategy. The proposed strategy can effectively identify grossly wrong scan-to-scan matches. Third, the minimum spanning tree is extracted from the graph, and ICP is applied along its edges. Moreover, the Lu-Milios algorithm is used to further optimize all poses at once by utilizing all redundant information in each scan-block. Finally, global block-to-block registration aligns all scan-blocks into a uniform coordinate reference. We test our framework on challenging WHU-TLS datasets, ETH datasets, and Robotic 3D Scan datasets to evaluate the efficiency, accuracy, as well as robustness. The experiment results show that our method achieves the state-of -the-art accuracy, while the time performance is improved by more than 30% compared with the state-of-the-art algorithms. Our source code is made available at https://github.com/WuHao-WHU/HL-MRF for benchmarking purposes.
引用
收藏
页码:65 / 76
页数:12
相关论文
共 49 条
[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]  
Andres B, 2012, LECT NOTES COMPUT SC, V7578, P154, DOI 10.1007/978-3-642-33786-4_12
[3]   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
[4]  
Borrmann D., 2008, P 4 INT S 3D DAT PRO, P29
[5]   Guaranteed Outlier Removal for Point Cloud Registration with Correspondences [J].
Bustos, Alvaro Parra ;
Chin, Tat-Jun .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2018, 40 (12) :2868-2882
[6]   Practical optimal registration of terrestrial LiDAR scan pairs [J].
Cai, Zhipeng ;
Chin, Tat-Jun ;
Bustos, Alvaro Parra ;
Schindler, Konrad .
ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 2019, 147 :118-131
[7]   3D free-form object recognition in range images using local surface patches [J].
Chen, Hui ;
Bhanu, Bir .
PATTERN RECOGNITION LETTERS, 2007, 28 (10) :1252-1262
[8]  
Chetverikov D, 2002, INT C PATT RECOG, P545, DOI 10.1109/ICPR.2002.1047997
[9]  
Chin T.J., 2017, Synth. Lect. Comput. Vis., V7, P1
[10]   Scan registration using segmented region growing NDT [J].
Das, Arun ;
Waslander, Steven L. .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2014, 33 (13) :1645-1663