Exact Camera Location Recovery by Least Unsquared Deviations
arXiv:1709.09683 · doi:10.1137/17M115061X
Abstract
We establish exact recovery for the Least Unsquared Deviations (LUD) algorithm of Ozyesil and Singer. More precisely, we show that for sufficiently many cameras with given corrupted pairwise directions, where both camera locations and pairwise directions are generated by a special probabilistic model, the LUD algorithm exactly recovers the camera locations with high probability. A similar exact recovery guarantee was established for the ShapeFit algorithm by Hand, Lee and Voroninski, but with typically less corruption.
References in corpus (6)
- Rank-Sparsity Incoherence for Matrix Decomposition
- A Novel M-Estimator for Robust PCA
- Planar Minimally Rigid Graphs and Pseudo-Triangulations
- Robust computation of linear models by convex relaxation
- ShapeFit and ShapeKick for Robust, Scalable Structure from Motion
- A New Rank Constraint on Multi-view Fundamental Matrices, and its Application to Camera Location Recovery