Density Adaptive Point Set Registration
Probabilistic methods for point set registration have demonstrated competitive results in recent years. These techniques estimate a probability distribution model of the point clouds. While such a representation has shown promise, it is highly sensitive to variations in the density of 3D points. This fundamental problem is primarily caused by changes in the sensor location across point sets. We revisit the foundations of the probabilistic registration paradigm. Contrary to previous works, we model the underlying structure of the scene as a latent probability distribution, and thereby induce invariance to point set density changes. Both the probabilistic model of the scene and the registration parameters are inferred by minimizing the Kullback-Leibler divergence in an Expectation Maximization based framework. Our density-adaptive registration successfully handles severe density variations commonly encountered in terrestrial Lidar applications. We perform extensive experiments on several challenging real-world Lidar datasets. The results demonstrate that our approach outperforms state-of-the-art probabilistic methods for multi-view registration, without the need of re-sampling. Code is available at https://github.com/felja633/DARE.
Code (1)
Similar Papers 제목 키워드 기반
End-to-End LiDAR optimization for 3D point cloud registration
LiDAR sensors are a key modality for 3D perception, yet they are typically designed independently of downstream tasks such as point cloud registration. Conventional registration operates on pre-acquired datasets with fix…
Point Cloud RegistrationCoFiNet: Reliable Coarse-to-fine Correspondences for Robust PointCloud Registration
We study the problem of extracting correspondences between a pair of point clouds for registration. For correspondence retrieval, existing works benefit from matching sparse keypoints detected from dense points but usual…
Keypoint DetectionPoint Cloud RegistrationRetrievalCoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration
We study the problem of extracting correspondences between a pair of point clouds for registration. For correspondence retrieval, existing works benefit from matching sparse keypoints detected from dense points but usual…
Keypoint DetectionPoint Cloud RegistrationRetrievalAn Adaptive ICP LiDAR Odometry Based on Reliable Initial Pose
As a key technology for autonomous navigation and positioning in mobile robots, light detection and ranging (LiDAR) odometry is widely used in autonomous driving applications. The Iterative Closest Point (ICP)-based meth…
Point Cloud RegistrationAutonomous DrivingPose EstimationPoint CloudsSDFReg: Learning Signed Distance Functions for Point Cloud Registration
Learning-based point cloud registration methods can handle clean point clouds well, while it is still challenging to generalize to noisy, partial, and density-varying point clouds. To this end, we propose a novel point c…
Point Cloud Registration