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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Tomasi C, Kanade T. Shape and motion from image streams under orthography: a factorization method. Int J Comput Vision, 1992, 9: 137–154
Jolliffe I. Principal Component Analysis. Berlin: Springer-Verlag, 1986.
Tomasi C, Kanade T. Detection and tracking of point features. Technical Report. 1991
Lowe G D. Distinctive image features from scale-invariant keypoints. Int J Comput Vision, 2004, 60: 91–110
Fischler M, Bolles R. Readings in Computer Vision: Issues, Problems, Principles, and Paradigms. Chapter Random Sample Consensus: a Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography. San Francisco: Morgan Kaufmann Publishers Inc, 1987
Wiberg T. Computation of principal components when data are missing. In: Proceedings of 2nd Symposium on Computational Statistics, Berlin, 1976. 229–236
Okatani T, Deguchi K. On the wiberg algorithm for matrix factorization in the presence of missing components. Int J Comput Vision, 2007, 72: 329–337
Eriksson A, Anton Van D H. Efficient computation of robust low-rank matrix approximations in the presence of missing data using the l1 norm. In: Proceedings of Computer Vision and Pattern Recognition. San Francisco: IEEE Computer Society, 2010. 771–778
Jacobs D. Linear fitting with missing data: applications to structure-from-motion and to characterizing intensity images. In: Proceedings of Computer Vision and Pattern Recognition. Washington: IEEE Computer Society, 1997. 206–212
Buchanan A, Fitzgibbon A. Damped Newton algorithms for matrix factorization with missing data. In: Proceedings of Computer Vision and Pattern Recognition. Washington: IEEE Computer Society, 2005. 316–322
Chen P, Suter D. Recovering the missing components in a large noisy low-rank matrix: application to sfm. In: Proceedings of Computer Vision and Pattern Recognition. Washington: IEEE Computer Society, 2004. 1051–1063
Chen P, Suter D. Optimization algorithms on subspaces: revisiting missing data problem in low-rank matrix. Int J Comput Vision, 2008, 80: 125–142
Wright J, Ganesh A, Rao S, et al. Robust principal component analysis: exact recovery of corrupted low-rank matrices by convex optimization. In: Proceedings of Neural Information Processing Systems, 2009
Chandrasekaran V, Sanghavi S, Parrilo P, et al. Sparse and low-rank matrix decompositions. In: Proceedings of IFAC Symposium on System Identification. Piscataway: IEEE Press, 2009. 962–967
Lin Z, Chen M, Wu L, et al. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. UIUC Technical Report UILU-ENG-09-2215. 2009
Morita T, Kanade T. A sequential factorization method for recovering shape and motion from image streams. IEEE Trans Pattern Anal, 1997, 19: 858–867
Ganesh A, Lin Z, Wright J, et al. Fast algorithms for recovering a corrupted low-rank matrix. In: Proceedings of Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). Aruba: IEEE Computer Society, 2009. 213–216
Toh K, Yun S. An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac J Optim, 2006, 6: 615–640
Bertsekas D. Nonlinear Programming. 2nd ed. Cambridge: Athena Scientific, 2004
Beck A, Teboulle M. A fast iterative shrinkage-thresholding algorithm for linear inverse problem. SIAM J Imag Sci, 2009, 2: 183–202
CMU image data base: hotel. http://vasc.ri.cmu.edu//idb/html/motion/hotel/index.html
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Wu, L., Wang, Y., Liu, Y. et al. Robust structure from motion with affine camera via low-rank matrix recovery. Sci. China Inf. Sci. 56, 1–10 (2013). https://doi.org/10.1007/s11432-012-4728-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-012-4728-y