Shonan Rotation Averaging: Global Optimality by Surfing $SO(p)^n$
About
Shonan Rotation Averaging is a fast, simple, and elegant rotation averaging algorithm that is guaranteed to recover globally optimal solutions under mild assumptions on the measurement noise. Our method employs semidefinite relaxation in order to recover provably globally optimal solutions of the rotation averaging problem. In contrast to prior work, we show how to solve large-scale instances of these relaxations using manifold minimization on (only slightly) higher-dimensional rotation manifolds, re-using existing high-performance (but local) structure-from-motion pipelines. Our method thus preserves the speed and scalability of current SFM methods, while recovering globally optimal solutions.
Frank Dellaert, David M. Rosen, Jing Wu, Robert Mahony, Luca Carlone• 2020
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Rotation Averaging | Synthetic Datasets | Rotational Error (R)5.37e-6 | 60 | |
| Multiple Rotation Averaging | Synthetic Dataset (test) | Mean Angular Error2.43 | 18 | |
| Multiple Rotation Averaging | Fountain (N=11) | Avg Rotation Error (Rij - RjRi^T)0.0042 | 4 | |
| Multiple Rotation Averaging | Castle N=15 | Avg Rotation Residual Error0.0013 | 4 | |
| Multiple Rotation Averaging | Herz-Jesus N=8 | Avg. Matrix Residual Error0.0039 | 4 |
Showing 5 of 5 rows