Shonan Rotation Averaging: Global Optimality by Surfing SO(p) <sup>n</sup>
Author(s)
Dellaert, Frank; Rosen, David Matthew; Wu, Jing; Mahony, Robert; Carlone, Luca
DownloadAccepted version (404.5Kb)
Open Access Policy
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
© 2020, Springer Nature Switzerland AG. 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.
Date issued
2020-11Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems; Massachusetts Institute of Technology. Department of Aeronautics and AstronauticsJournal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher
Springer International Publishing
Citation
Dellaert, Frank, Rosen, David Matthew, Wu, Jing, Mahony, Robert and Carlone, Luca. 2020. "Shonan Rotation Averaging: Global Optimality by Surfing SO(p) <sup>n</sup>." Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12351 LNCS.
Version: Author's final manuscript