{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:08:56Z","timestamp":1771700936868,"version":"3.50.1"},"reference-count":17,"publisher":"Zhejiang University Press","issue":"12","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Zhejiang Univ. - Sci. C"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1631\/jzus.c1200180","type":"journal-article","created":{"date-parts":[[2012,12,8]],"date-time":"2012-12-08T03:13:12Z","timestamp":1354936392000},"page":"901-908","source":"Crossref","is-referenced-by-count":2,"title":["Learning robust principal components from L1-normmaximization"],"prefix":"10.1631","volume":"13","author":[{"given":"Ding-cheng","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-li","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"635","published-online":{"date-parts":[[2012,12,9]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-7566-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937541"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143880"},{"key":"ref4","volume-title":"Pattern Classification","author":"Duda","year":"2001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-491-1","volume-title":"Natural Image Statistics","author":"Hyv\u00e4rinen","year":"2009"},{"key":"ref7","article-title":"Robust Subspace Computation Using L1 Norm","volume-title":"Technical Report, School of Computer Science","author":"Ke","year":"2003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr.2005.309"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2008.114"},{"key":"ref10","first-page":"1017","article-title":"ICA with Reconstruction Cost for Efficient Overcomplete Feature Learning","volume":"24","author":"Le","year":"2011","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref11","first-page":"339","article-title":"Multi-task Feature Learning via Efficient L2,1-Norm Minimization","volume-title":"Proc. 25th Conf. on Uncertainty in Artificial Intelligence","author":"Liu","year":"2009"},{"key":"ref12","first-page":"497","article-title":"On Bayesian PCA: Automatic Dimensionality Selection and Analytic Solution","volume-title":"Proc. 28th Int. Conf. on Machine Learning","author":"Nakajima","year":"2011"},{"key":"ref13","first-page":"1813","article-title":"Efficient and Robust Feature Selection via Joint L2, 1-Norms Minimization","volume":"23","author":"Nie","year":"2010","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref14","first-page":"1433","article-title":"Robust Principal Component Analysis with Non-greedy L1-Norm Maximization","volume-title":"Proc. 22nd Int. Joint Conf. on Artificial Intelligence","author":"Nie","year":"2011"},{"key":"ref15","first-page":"2080","article-title":"Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization","volume":"22","author":"Wright","year":"2009","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0200"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1631\/jzus.c1000148"}],"container-title":["Journal of Zhejiang University SCIENCE C"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1631\/jzus.C1200180.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1631\/jzus.C1200180\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1631\/jzus.C1200180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:34:28Z","timestamp":1771659268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1631\/jzus.C1200180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":17,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["1365"],"URL":"https:\/\/doi.org\/10.1631\/jzus.c1200180","relation":{},"ISSN":["1869-1951","1869-196X"],"issn-type":[{"value":"1869-1951","type":"print"},{"value":"1869-196X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}