Accelerating Outlier-robust Rotation Estimation by Stereographic Projection
Not on the map. Why?
Abstract (arXiv)
Rotation estimation plays a fundamental role in many computer vision and robot tasks. However, efficiently estimating rotation in large inputs containing numerous outliers (i.e., mismatches) and noise is a recognized challenge. Many robust rotation estimation methods have been designed to address this challenge. Unfortunately, existing methods are often inapplicable due to their long computation time and the risk of local optima. In this paper, we propose an efficient and robust rotation estimation method. Specifically, our method first investigates geometric constraints involving only the rotation axis. Then, it uses stereographic projection and spatial voting techniques to identify the rotation axis and angle. Furthermore, our method efficiently obtains the optimal rotation estimation and can estimate multiple rotations simultaneously. To verify the feasibility of our method, we conduct comparative experiments using both synthetic and real-world data. The results show that, with GPU assistance, our method can solve large-scale (106 points) and severely corrupted (90% outlier rate) rotation estimation problems within 0.07 seconds, with an angular error of only 0.01 degrees, which is superior to existing methods in terms of accuracy and efficiency.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 45 references that are in the map. First posted on arXiv 10 Feb 2025.
Builds on
24 of 45 references.
References · 24
- 2019Deep Hough Voting for 3D Object Detection in Point Cloudscited by 648
- 20163DMatch: Learning Local Geometric Descriptors from RGB-D Reconstructionscited by 333
- 2019Deep Closest Point: Learning Representations for Point Cloud Registrationcited by 318
- 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274
- 2019PointNetLK: Robust & Efficient Point Cloud Registration using PointNetcited by 231
- 2020Deep Global Registrationcited by 228
- 2017Learning to Find Good Correspondencescited by 176
- 2021PointDSC: Robust Point Cloud Registration using Deep Spatial Consistencycited by 142
- 2017Graph-Cut RANSACcited by 133
- 20193DRegNet: A Deep Neural Network for 3D Point Registrationcited by 96
- 2021A comprehensive survey on point cloud registrationcited by 84
- 2017Guaranteed Outlier Removal for Point Cloud Registration with Correspondencescited by 62
12 more
- 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
- 2019Progressive-X: Efficient, Anytime, Multi-Model Fitting Algorithmcited by 43
- 2020CONSAC: Robust Multi-Model Fitting by Conditional Sample Consensuscited by 30
- 2021PHASER: a Robust and Correspondence-free Global Pointcloud Registrationcited by 15
- 2022ARCS: Accurate Rotation and Correspondence Searchcited by 15
- 2021DetarNet: Decoupling Translation and Rotation by Siamese Network for Point Cloud Registrationcited by 12
- 2023Quantum Multi-Model Fittingcited by 12
- 2021On the Tightness of Semidefinite Relaxations for Rotation Estimationcited by 7
- 2024Multi-Model 3D Registration: Finding Multiple Moving Objects in Cluttered Point Cloudscited by 7
- 2019Speeding Up Iterative Closest Point Using Stochastic Gradient Descentcited by 3
- 2022ROSIA: Rotation-Search-Based Star Identification Algorithmcited by 2
Built on by
Not cited yet.