Message Passing Least Squares Framework and its Application to Rotation Synchronization
arXiv:2007.13638
Abstract
We propose an efficient algorithm for solving group synchronization under high levels of corruption and noise, while we focus on rotation synchronization. We first describe our recent theoretically guaranteed message passing algorithm that estimates the corruption levels of the measured group ratios. We then propose a novel reweighted least squares method to estimate the group elements, where the weights are initialized and iteratively updated using the estimated corruption levels. We demonstrate the superior performance of our algorithm over state-of-the-art methods for rotation synchronization using both synthetic and real data.
arXiv commentTo Appear in ICML 2020 Proceedings
References in corpus (8)
- Message Passing Algorithms for Compressed Sensing
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Message-passing algorithms for synchronization problems over compact groups
- Robust Rotation Synchronization via Low-rank and Sparse Matrix Decomposition
- Bayesian Pose Graph Optimization via Bingham Distributions and Tempered Geodesic MCMC
- Exact Camera Location Recovery by Least Unsquared Deviations
- Robust Multi-object Matching via Iterative Reweighting of the Graph Connection Laplacian
- A New Rank Constraint on Multi-view Fundamental Matrices, and its Application to Camera Location Recovery