Performance Guarantees for Spectral Initialization in Rotation Averaging and Pose-Graph SLAM

In this work we present the first initialization methods equipped with explicit performance guarantees that are adapted to the pose-graph simultaneous localization and mapping (SLAM) and rotation averaging (RA) problems. SLAM and rotation averaging are typically formalized as large-scale nonconvex point estimation problems, with many bad local minima that can entrap the smooth optimization methods typically applied to solve them; the performance of standard SLAM and RA algorithms thus crucially depends upon the quality of the estimates used to initialize this local search. While many initialization methods for SLAM and RA have appeared in the literature, these are typically obtained as purely heuristic approximations, making it difficult to determine whether (or under what circumstances) these techniques can be reliably deployed. In contrast, in this work we study the problem of initialization through the lens of spectral relaxation. Specifically, we derive a simple spectral relaxation of SLAM and RA, the form of which enables us to exploit classical linear-algebraic techniques (eigenvector perturbation bounds) to control the distance from our spectral estimate to both the (unknown) ground-truth and the global minimizer of the estimation problem as a function of measurement noise. Our results reveal the critical role that spectral graph-theoretic properties of the measurement network play in controlling estimation accuracy; moreover, as a by-product of our analysis we obtain new bounds on the estimation error for the maximum likelihood estimators in SLAM and RA, which are likely to be of independent interest. Finally, we show experimentally that our spectral estimator is very effective in practice, producing initializations of comparable or superior quality at lower computational cost compared to existing state-of-the-art techniques. ∗Corresponding author. Email: kjd@csail.mit.edu 1 ar X iv :2 20 1. 03 77 3v 1 [ cs .R O ] 1 1 Ja n 20 22

[1]  Amit Singer,et al.  Robust estimation of rotations from relative measurements by maximum likelihood , 2013, 52nd IEEE Conference on Decision and Control.

[2]  Levent Tunçel,et al.  Optimization algorithms on matrix manifolds , 2009, Math. Comput..

[3]  A. Singer Angular Synchronization by Eigenvectors and Semidefinite Programming. , 2009, Applied and computational harmonic analysis.

[4]  Amit Singer,et al.  Tightness of the maximum likelihood semidefinite relaxation for angular synchronization , 2014, Math. Program..

[5]  S. Umeyama,et al.  Least-Squares Estimation of Transformation Parameters Between Two Point Patterns , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Brian Patrick Preskitt Phase Retrieval from Locally Supported Measurements , 2018 .

[7]  Vincent D. Blondel,et al.  Cramér-Rao bounds for synchronization of rotations , 2012, ArXiv.

[8]  João Paulo Costeira,et al.  Fast Pose Graph Optimization via Krylov-Schur and Cholesky Factorization , 2021, 2021 IEEE Winter Conference on Applications of Computer Vision (WACV).

[9]  G. Dissanayake,et al.  Cramér–Rao Bounds and Optimal Design Metrics for Pose-Graph SLAM , 2021, IEEE Transactions on Robotics.

[10]  Andrea Fusiello,et al.  Spectral Synchronization of Multiple Views in SE(3) , 2016, SIAM J. Imaging Sci..

[11]  Frank Dellaert,et al.  Shonan Rotation Averaging: Global Optimality by Surfing SO(p)n , 2020, ECCV.

[12]  Tengyao Wang,et al.  A useful variant of the Davis--Kahan theorem for statisticians , 2014, 1405.0680.

[13]  Anthony Man-Cho So,et al.  A Unified Approach to Synchronization Problems over Subgroups of the Orthogonal Group , 2020, ArXiv.

[14]  Giuseppe Carlo Calafiore,et al.  Lagrangian duality in 3D SLAM: Verification techniques and optimal solutions , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[15]  John J. Leonard,et al.  Advances in Inference and Representation for Simultaneous Localization and Mapping , 2021, Annu. Rev. Control. Robotics Auton. Syst..

[16]  Shuyang Ling Near-Optimal Performance Bounds for Orthogonal and Permutation Group Synchronization via Spectral Methods. , 2020 .

[17]  Michael Rubenstein,et al.  CPL-SLAM: Efficient and Certifiably Correct Planar Graph-Based SLAM Using the Complex Number Representation , 2020, IEEE Transactions on Robotics.

[18]  Giuseppe Carlo Calafiore,et al.  Planar Pose Graph Optimization: Duality, Optimal Solutions, and Verification , 2016, IEEE Transactions on Robotics.

[19]  Nicolas Boumal,et al.  Nonconvex Phase Synchronization , 2016, SIAM J. Optim..

[20]  Gamini Dissanayake,et al.  Novel insights into the impact of graph structure on SLAM , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[21]  Jonathan P. How,et al.  Distributed Certifiably Correct Pose-Graph Optimization , 2019 .

[22]  John J. Leonard,et al.  SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group , 2016, Int. J. Robotics Res..

[23]  Wolfram Burgard,et al.  A Tutorial on Graph-Based SLAM , 2010, IEEE Intelligent Transportation Systems Magazine.

[24]  Byron Boots,et al.  A Spectral Learning Approach to Range-Only SLAM , 2012, ICML.

[25]  R. Hanson,et al.  Analysis of Measurements Based on the Singular Value Decomposition , 1981 .

[26]  Nitakshi Goyal,et al.  General Topology-I , 2017 .

[27]  Tomás Pajdla,et al.  Robust Rotation and Translation Estimation in Multiview Reconstruction , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[28]  Javier González,et al.  Cartan-Sync: Fast and Global SE(d)-Synchronization , 2017, IEEE Robotics and Automation Letters.

[29]  Frank Dellaert,et al.  Initialization techniques for 3D SLAM: A survey on rotation estimation and its use in pose graph optimization , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).