arXiv Analytics

Sign in

arXiv:1505.06079 [cs.CV]AbstractReferencesReviewsResources

Robust Rotation Synchronization via Low-rank and Sparse Matrix Decomposition

Federica Arrigoni, Andrea Fusiello, Beatrice Rossi, Pasqualina Fragneto

Published 2015-05-22Version 1

This paper deals with the rotation synchronization problem, which arises in global registration of 3D point-sets and in structure from motion. The problem is formulated in an unprecedented way as a "low-rank and sparse" matrix decomposition that handles both outliers and missing data. A minimization strategy, dubbed R-GoDec, is also proposed and evaluated experimentally against state-of-the-art algorithms on simulated and real data. The results show that R-GoDec is the fastest among the robust algorithms.

Related articles: Most relevant | Search more
arXiv:1709.08393 [cs.CV] (Published 2017-09-25)
Multi-view Registration Based on Weighted Low Rank and Sparse Matrix Decomposition of Motions
arXiv:2305.05268 [cs.CV] (Published 2023-05-09)
Rotation Synchronization via Deep Matrix Factorization
arXiv:1411.6206 [cs.CV] (Published 2014-11-23)
Low-Rank and Sparse Matrix Decomposition with a-priori knowledge for Dynamic 3D MRI reconstruction