Robust structure from motion with affine camera via low-rank matrix recovery

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a novel approach to structure from motion that can deal with missing data and outliers with an affine camera. We model the corruptions as sparse error. Therefore the structure from motion problem is reduced to the problem of recovering a low-rank matrix from corrupted observations. We first decompose the matrix of trajectories of features into low-rank and sparse components by nuclear-norm and ℓ 1-norm minimization, and then obtain the motion and structure from the low-rank components by the classical factorization method. Unlike pervious methods, which have some drawbacks such as depending on the initial value selection and being sensitive to the large magnitude errors, our method uses a convex optimization technique that is guaranteed to recover the low-rank matrix from highly corrupted and incomplete observations. Experimental results demonstrate that the proposed approach is more efficient and robust to large-scale outliers. © 2013 Science China Press and Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wu, L., Wang, Y. T., Liu, Y., & Wang, Y. X. (2013). Robust structure from motion with affine camera via low-rank matrix recovery. Science China Information Sciences, 56(11), 1–10. https://doi.org/10.1007/s11432-012-4728-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free