The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Download
Publications Copernicus
Download
Citation
Articles | Volume XLIII-B1-2022
https://doi.org/10.5194/isprs-archives-XLIII-B1-2022-129-2022
https://doi.org/10.5194/isprs-archives-XLIII-B1-2022-129-2022
30 May 2022
 | 30 May 2022

A 3D SEGMENTS BASED ALGORITHM FOR HETEROGENEOUS DATA REGISTRATION

R. Djahel, P. Monasse, and B. Vallet

Keywords: 3D segments, 3D reconstruction, Clustering, RANSAC, Simulated Annealing, Registration. Heterogeneous data

Abstract. Combining image and LiDAR draws increasing interest in surface reconstruction, city and building modeling for constructing 3D virtual reality models because of their complementary nature. However, to gain from this complementarity, these data sources must be precisely registered. In this paper, we propose a new primitive based registration algorithm that takes 3D segments as features. The objective of the proposed algorithm is to register heterogeneous data. The heterogeneity is both in data type (image and LiDAR) and acquisition platform (terrestrial and aerial). Our algorithm starts by extracting 3D segments from LiDAR and image data with state of the art algorithms. Then it clusters the 3D segments of each data according to their directions. The obtained clusters are associated to find possible rotations, then 3D segments from associated clusters are matched in order to find the translation and scale factor minimizing a distance criteria between the two sets of 3D segments. Two optimizers (simulated annealing and RANSAC) are tested to minimize this distance criterion, first on synthetic data, then on real data. The experiments carried out demonstrate the robustness and speed of RANSAC compared to simulated annealing.