Globally Optimal Registration of Dense Terrestrial Laser Scans from Coarse Sampling

3D point cloud registration is paramount for mapping complex environments. However, aligning overlapping clouds remains computationally demanding due to the increasing size and density of data from modern Terrestrial Laser Scanners. In this paper, we propose a lightweight, memory-efficient registration approach that operates directly on a coarse level of detail extracted from octree structures. Rather than relying on keypoints, we construct full coarse representations and associate each point with a descriptor to form global feature maps. We evaluate several point distribution strategies for building these representations and show that our approach significantly reduces processing time and memory usage while maintaining or improving registration accuracy.

Authors

Institutions

Publication Details

Published
2025-10-19
DOI
https://doi.org/10.1109/iccvw69036.2025.00734
Primary Topic
Robotics and Sensor-Based Localization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Globally Optimal Registration of Dense Terrestrial Laser Scans from Coarse Sampling

Guillaume Caron, El Mustapha Mouaddib, Fumio Kanehiro, D.R. Kempf
Robotics and Sensor-Based Localization
article

Globally Optimal Registration of Dense Terrestrial Laser Scans from Coarse Sampling

Guillaume Caron, El Mustapha Mouaddib, Fumio Kanehiro, D.R. Kempf
article en

Abstract

3D point cloud registration is paramount for mapping complex environments. However, aligning overlapping clouds remains computationally demanding due to the increasing size and density of data from modern Terrestrial Laser Scanners. In this paper, we propose a lightweight, memory-efficient registration approach that operates directly on a coarse level of detail extracted from octree structures. Rather than relying on keypoints, we construct full coarse representations and associate each point with a descriptor to form global feature maps. We evaluate several point distribution strategies for building these representations and show that our approach significantly reduces processing time and memory usage while maintaining or improving registration accuracy.

Modélisation, information et systèmes (FR), Université de Picardie Jules Verne (FR), National Institute of Advanced Industrial Science and Technology (JP)
Openalex Percentile: Top 49%
Robotics and Sensor-Based Localization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.