{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:19:08Z","timestamp":1648765148801},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2013,1,15]],"date-time":"2013-01-15T00:00:00Z","timestamp":1358208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"},{"start":{"date-parts":[[2013,1,15]],"date-time":"2013-01-15T00:00:00Z","timestamp":1358208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>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 <jats:italic>\u2113<\/jats:italic>\n            <jats:sub>1<\/jats:sub>-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.<\/jats:p>","DOI":"10.1007\/s11432-012-4728-y","type":"journal-article","created":{"date-parts":[[2013,1,15]],"date-time":"2013-01-15T14:26:26Z","timestamp":1358259986000},"page":"1-10","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust structure from motion with affine camera via low-rank matrix recovery"],"prefix":"10.1007","volume":"56","author":[{"given":"Lun","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YongTian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YuXi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,15]]},"reference":[{"key":"4728_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF00129684","volume":"9","author":"C Tomasi","year":"1992","unstructured":"Tomasi C, Kanade T. Shape and motion from image streams under orthography: a factorization method. Int J Comput Vision, 1992, 9: 137\u2013154","journal-title":"Int J Comput Vision"},{"key":"4728_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1904-8","volume-title":"Principal Component Analysis","author":"I Jolliffe","year":"1986","unstructured":"Jolliffe I. Principal Component Analysis. Berlin: Springer-Verlag, 1986."},{"key":"4728_CR3","volume-title":"Detection and tracking of point features. Technical Report","author":"C Tomasi","year":"1991","unstructured":"Tomasi C, Kanade T. Detection and tracking of point features. Technical Report. 1991"},{"key":"4728_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"G D Lowe","year":"2004","unstructured":"Lowe G D. Distinctive image features from scale-invariant keypoints. Int J Comput Vision, 2004, 60: 91\u2013110","journal-title":"Int J Comput Vision"},{"key":"4728_CR5","volume-title":"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","author":"M Fischler","year":"1987","unstructured":"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"},{"key":"4728_CR6","first-page":"229","volume-title":"Proceedings of 2nd Symposium on Computational Statistics, Berlin","author":"T Wiberg","year":"1976","unstructured":"Wiberg T. Computation of principal components when data are missing. In: Proceedings of 2nd Symposium on Computational Statistics, Berlin, 1976. 229\u2013236"},{"key":"4728_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s11263-006-9785-5","volume":"72","author":"T Okatani","year":"2007","unstructured":"Okatani T, Deguchi K. On the wiberg algorithm for matrix factorization in the presence of missing components. Int J Comput Vision, 2007, 72: 329\u2013337","journal-title":"Int J Comput Vision"},{"key":"4728_CR8","first-page":"771","volume-title":"Proceedings of Computer Vision and Pattern Recognition. San Francisco: IEEE Computer Society","author":"A Eriksson","year":"2010","unstructured":"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\u2013778"},{"key":"4728_CR9","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/CVPR.1997.609321","volume-title":"Proceedings of Computer Vision and Pattern Recognition. Washington: IEEE Computer Society","author":"D Jacobs","year":"1997","unstructured":"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\u2013212"},{"key":"4728_CR10","first-page":"316","volume-title":"Proceedings of Computer Vision and Pattern Recognition","author":"A Buchanan","year":"2005","unstructured":"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\u2013322"},{"key":"4728_CR11","first-page":"1051","volume-title":"Proceedings of Computer Vision and Pattern Recognition","author":"P Chen","year":"2004","unstructured":"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\u20131063"},{"key":"4728_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s11263-008-0135-7","volume":"80","author":"P Chen","year":"2008","unstructured":"Chen P, Suter D. Optimization algorithms on subspaces: revisiting missing data problem in low-rank matrix. Int J Comput Vision, 2008, 80: 125\u2013142","journal-title":"Int J Comput Vision"},{"key":"4728_CR13","volume-title":"Proceedings of Neural Information Processing Systems","author":"J Wright","year":"2009","unstructured":"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"},{"key":"4728_CR14","first-page":"962","volume-title":"Proceedings of IFAC Symposium on System Identification","author":"V Chandrasekaran","year":"2009","unstructured":"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\u2013967"},{"key":"4728_CR15","series-title":"UIUC Technical Report","volume-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"Z Lin","year":"2009","unstructured":"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"},{"key":"4728_CR16","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1109\/34.608289","volume":"19","author":"T Morita","year":"1997","unstructured":"Morita T, Kanade T. A sequential factorization method for recovering shape and motion from image streams. IEEE Trans Pattern Anal, 1997, 19: 858\u2013867","journal-title":"IEEE Trans Pattern Anal"},{"key":"4728_CR17","first-page":"213","volume-title":"Proceedings of Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","author":"A Ganesh","year":"2009","unstructured":"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\u2013216"},{"key":"4728_CR18","first-page":"615","volume":"6","author":"K Toh","year":"2006","unstructured":"Toh K, Yun S. An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac J Optim, 2006, 6: 615\u2013640","journal-title":"Pac J Optim"},{"key":"4728_CR19","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"2004","unstructured":"Bertsekas D. Nonlinear Programming. 2nd ed. Cambridge: Athena Scientific, 2004","edition":"2nd ed."},{"key":"4728_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M. A fast iterative shrinkage-thresholding algorithm for linear inverse problem. SIAM J Imag Sci, 2009, 2: 183\u2013202","journal-title":"SIAM J Imag Sci"},{"key":"4728_CR21","unstructured":"CMU image data base: hotel. http:\/\/vasc.ri.cmu.edu\/\/idb\/html\/motion\/hotel\/index.html"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-012-4728-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-012-4728-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-012-4728-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-012-4728-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T21:14:52Z","timestamp":1630530892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-012-4728-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,15]]},"references-count":21,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["4728"],"URL":"https:\/\/doi.org\/10.1007\/s11432-012-4728-y","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,15]]},"assertion":[{"value":"16 September 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2012","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}