Towards Efficient Indoor/Outdoor Registration Using Planar Polygons - École des Ponts ParisTech Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Towards Efficient Indoor/Outdoor Registration Using Planar Polygons

Résumé

The registration of indoor and outdoor scans with a precision reaching the level of geometric noise represents a major challenge for Indoor/Outdoor building modeling. The basic idea of the contribution presented in this paper consists in extracting planar polygons from indoor and outdoor LiDAR scans, and then matching them. In order to cope with the very small overlap between indoor and outdoor scans of the same building, we propose to start by extracting points lying in the buildings’ interior from the outdoor scans as points where the laser ray crosses detected façades. Since, within a building environment, most of the objects are bounded by a planar surface, we propose a new registration algorithm that matches planar polygons by clustering polygons according to their normal direction, then by their offset in the normal direction. We use this clustering to find possible polygon correspondences (hypotheses) and estimate the optimal transformation for each hypothesis. Finally, a quality criteria is computed for each hypothesis in order to select the best one. To demonstrate the accuracy of our algorithm, we tested it on real data with a static indoor acquisition and a dynamic (Mobile Laser Scanning) outdoor acquisition.
Fichier principal
Vignette du fichier
isprs-annals-V-2-2021-51-2021.pdf (1.49 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03643580 , version 1 (16-04-2022)

Identifiants

Citer

Rahima Djahel, Pascal Monasse, Bruno Vallet. Towards Efficient Indoor/Outdoor Registration Using Planar Polygons. XXIV ISPRS Congress, Jul 2021, Virtual event, France. pp.51-58, ⟨10.5194/isprs-annals-V-2-2021-51-2021⟩. ⟨hal-03643580⟩
143 Consultations
75 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More