Robust synchronization in SO(3) and SE(3) via low-rank and sparse matrix decomposition

摘要

This paper deals with the synchronization problem, which arises in multiple 3D point-set registration and in structure-from-motion. The problem is formulated as alow-rank and sparsematrix decomposition that caters for missing data, outliers and noise, and it benefits from a wealth of available decomposition algorithms that can be plugged-in. A minimization strategy, dubbedR-GoDec, is also proposed. Experimental results on simulated and real data show that this approach offers a good trade-off between resistance to outliers and speed.