ARCS: Accurate Rotation and Correspondence Search
Liangzu Peng, Manolis C. Tsakiris, Ren\'e Vidal

TL;DR
ARCS introduces a fast, robust algorithm for simultaneous rotation and correspondence search in large 3D point sets, outperforming existing methods in speed and accuracy.
Contribution
The paper presents ARCS, a novel solver for the generalized Wahba problem that is efficient, scalable, and robust to noise, with an extension ARCS+ for joint rotation and correspondence estimation.
Findings
ARCS solves large-scale problems in about 0.1 seconds.
ARCS+ achieves state-of-the-art accuracy on datasets with over 10^6 points.
The methods outperform existing approaches by a factor of 10^4 in speed.
Abstract
This paper is about the old Wahba problem in its more general form, which we call "simultaneous rotation and correspondence search". In this generalization we need to find a rotation that best aligns two partially overlapping D point sets, of sizes and respectively with . We first propose a solver, , that i) assumes noiseless point sets in general position, ii) requires only inliers, iii) uses time and space, and iv) can successfully solve the problem even with, e.g., in about seconds. We next robustify to noise, for which we approximately solve consensus maximization problems using ideas from robust subspace learning and interval stabbing. Thirdly, we refine the approximately found consensus set by a Riemannian subgradient descent approach over the space of unit quaternions, which we show…
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
TopicsNeural Networks and Applications · Robotics and Sensor-Based Localization · Image Retrieval and Classification Techniques
