Practical optimal registration of terrestrial LiDAR scan pairs
Zhipeng Cai, Tat-Jun Chin, Alvaro Parra Bustos, Konrad Schindler

TL;DR
This paper introduces a fast, optimal registration method for terrestrial LiDAR scans that leverages azimuth constraints, significantly improving accuracy and efficiency over traditional heuristic approaches.
Contribution
It presents a novel, optimal registration algorithm tailored for 4DOF LiDAR scans, combining candidate correspondence reduction and a new polynomial-time rotation search.
Findings
Achieves optimal registration efficiently in realistic scenarios.
Reduces candidate correspondences without losing the optimal solution.
Demonstrates effectiveness on real LiDAR survey data.
Abstract
Point cloud registration is a fundamental problem in 3D scanning. In this paper, we address the frequent special case of registering terrestrial LiDAR scans (or, more generally, levelled point clouds). Many current solutions still rely on the Iterative Closest Point (ICP) method or other heuristic procedures, which require good initializations to succeed and/or provide no guarantees of success. On the other hand, exact or optimal registration algorithms can compute the best possible solution without requiring initializations; however, they are currently too slow to be practical in realistic applications. Existing optimal approaches ignore the fact that in routine use the relative rotations between scans are constrained to the azimuth, via the built-in level compensation in LiDAR scanners. We propose a novel, optimal and computationally efficient registration method for this 4DOF…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotics and Sensor-Based Localization · 3D Surveying and Cultural Heritage · Robotic Path Planning Algorithms
