Transformation Decoupling Strategy based on Screw Theory for Deterministic Point Cloud Registration with Gravity Prior
Not on the map. Why?
Abstract (arXiv)
Point cloud registration is challenging in the presence of heavy outlier correspondences. This paper focuses on addressing the robust correspondence-based registration problem with gravity prior that often arises in practice. The gravity directions are typically obtained by inertial measurement units (IMUs) and can reduce the degree of freedom (DOF) of rotation from 3 to 1. We propose a novel transformation decoupling strategy by leveraging screw theory. This strategy decomposes the original 4-DOF problem into three sub-problems with 1-DOF, 2-DOF, and 1-DOF, respectively, thereby enhancing the computation efficiency. Specifically, the first 1-DOF represents the translation along the rotation axis and we propose an interval stabbing-based method to solve it. The second 2-DOF represents the pole which is an auxiliary variable in screw theory and we utilize a branch-and-bound method to solve it. The last 1-DOF represents the rotation angle and we propose a global voting method for its estimation. The proposed method sequentially solves three consensus maximization sub-problems, leading to efficient and deterministic registration. In particular, it can even handle the correspondence-free registration problem due to its significant robustness. Extensive experiments on both synthetic and real-world datasets demonstrate that our method is more efficient and robust than state-of-the-art methods, even when dealing with outlier rates exceeding 99%.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 50 of its 122 references that are in the map. First posted on arXiv 2 Nov 2023.
Builds on
50 of 122 references.
References · 50
- 2019Deep Learning for 3D Point Clouds: A Surveycited by 557
- 20163DMatch: Learning Local Geometric Descriptors from RGB-D Reconstructionscited by 333
- 2019Deep Closest Point: Learning Representations for Point Cloud Registrationcited by 318
- 2020PREDATOR: Registration of 3D Point Clouds with Low Overlapcited by 287
- 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274
- 2019PointNetLK: Robust & Efficient Point Cloud Registration using PointNetcited by 231
- 2020Deep Global Registrationcited by 228
- 2022Geometric Transformer for Fast and Robust Point Cloud Registrationcited by 200
- 2020RPM-Net: Robust Point Matching using Learned Featurescited by 181
- 2021FAST-LIO2: Fast Direct LiDAR-inertial Odometrycited by 170
- 2018The Perfect Match: 3D Point Cloud Matching with Smoothed Densitiescited by 169
- 2016Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registrationcited by 159
38 more
- 2021CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registrationcited by 151
- 2021PointDSC: Robust Point Cloud Registration using Deep Spatial Consistencycited by 142
- 20183DFeat-Net: Weakly Supervised Local 3D Features for Point Cloud Registrationcited by 100
- 20193DRegNet: A Deep Neural Network for 3D Point Registrationcited by 96
- 2022REGTR: End-to-end Point Cloud Correspondences with Transformerscited by 94
- 2020DeepGMR: Learning Latent Gaussian Mixture Models for Registrationcited by 91
- 20233D Registration with Maximal Cliquescited by 83
- 2023GeoTransformer: Fast and Robust Point Cloud Registration with Geometric Transformercited by 83
- 2018Discovery of Latent 3D Keypoints via End-to-end Geometric Reasoningcited by 79
- 2021You Only Hypothesize Once: Point Cloud Registration with Rotation-equivariant Descriptorscited by 68
- 2023Rotation-Invariant Transformer for Point Cloud Matchingcited by 68
- 2020Fast and Robust Iterative Closest Pointcited by 67
- 2020SOE-Net: A Self-Attention and Orientation Encoding Network for Point Cloud based Place Recognitioncited by 66
- 2017Guaranteed Outlier Removal for Point Cloud Registration with Correspondencescited by 62
- 2022SC^2-PCR: A Second Order Spatial Compatibility for Efficient and Robust Point Cloud Registrationcited by 62
- 2021Deep Hough Voting for Robust Global Registrationcited by 53
- 2022A9-Dataset: Multi-Sensor Infrastructure-Based Dataset for Mobility Researchcited by 40
- 2023Robust Outlier Rejection for 3D Registration with Variational Bayescited by 31
- 2018Robust Fitting in Computer Vision: Easy or Hard?cited by 25
- 2023InfraDet3D: Multi-Modal 3D Object Detection based on Roadside Infrastructure Camera and LiDAR Sensorscited by 25
- 2016GOGMA: Globally-Optimal Gaussian Mixture Alignmentcited by 22
- 2022A Single Correspondence Is Enough: Robust Global Registration to Avoid Degeneracy in Urban Environmentscited by 19
- 2018Practical optimal registration of terrestrial LiDAR scan pairscited by 16
- 2022ARCS: Accurate Rotation and Correspondence Searchcited by 15
- 2023Accelerating Globally Optimal Consensus Maximization in Geometric Visioncited by 14
- 2020Globally Optimal Relative Pose Estimation with Gravity Priorcited by 13
- 2020RSKDD-Net: Random Sample-based Keypoint Detector and Descriptorcited by 12
- 2021DetarNet: Decoupling Translation and Rotation by Siamese Network for Point Cloud Registrationcited by 12
- 2017Deterministic Approximate Methods for Maximum Consensus Robust Fittingcited by 11
- 2022A New Outlier Removal Strategy Based on Reliability of Correspondence Graph for Fast Point Cloud Registrationcited by 10
- 2016Efficient Global Point Cloud Alignment using Bayesian Nonparametric Mixturescited by 9
- 2017In search of inliers: 3d correspondence by local and global votingcited by 7
- 2020Minimal Solutions for Panoramic Stitching Given Gravity Priorcited by 6
- 2023Efficient and Deterministic Search Strategy Based on Residual Projections for Point Cloud Registration with Correspondencescited by 5
- 2018Fast and Globally Optimal Rigid Registration of 3D Point Sets by Transformation Decompositioncited by 4
- 2021Trust Your IMU: Consequences of Ignoring the IMU Driftcited by 3
- 2022Gravity-constrained point cloud registrationcited by 2
- 2021A Biologically Inspired Global Localization System for Mobile Robots Using LiDAR Sensorcited by 1
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.