{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:00:06Z","timestamp":1740142806474,"version":"3.37.3"},"reference-count":25,"publisher":"Oxford University Press (OUP)","issue":"11","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602397"],"award-info":[{"award-number":["61602397"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,11,1]]},"DOI":"10.1093\/comjnl\/bxx006","type":"journal-article","created":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T08:23:50Z","timestamp":1485764630000},"page":"1609-1618","source":"Crossref","is-referenced-by-count":1,"title":["Matrix Separation Based on LMaFit-Seed"],"prefix":"10.1093","volume":"60","author":[{"given":"Hai-Xia","family":"Xu","sequence":"first","affiliation":[]},{"given":"Wei","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Yao-Nan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Mo","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2017,2,13]]},"reference":[{"key":"key\n\t\t\t\t20171108074728_bxx006C1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s11263-014-0738-0","article-title":"Robust visual tracking via consistent low-rank sparse learning","volume":"111","year":"2015","journal-title":"Int. J. Comput. Vis. (IJCV)"},{"year":"2012","key":"key\n\t\t\t\t20171108074728_bxx006C2"},{"year":"2012","key":"key\n\t\t\t\t20171108074728_bxx006C3"},{"year":"2014","key":"key\n\t\t\t\t20171108074728_bxx006C4"},{"key":"key\n\t\t\t\t20171108074728_bxx006C5","first-page":"2080","article-title":"Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization","volume":"22","year":"2009","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"key\n\t\t\t\t20171108074728_bxx006C6","first-page":"1","article-title":"Robust principal component analysis?","volume":"58","year":"2011","journal-title":"J. ACM"},{"key":"key\n\t\t\t\t20171108074728_bxx006C7","first-page":"612","article-title":"Linearized alternating direction method with adaptive penalty for low-rank representation","volume":"24","year":"2011","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"key\n\t\t\t\t20171108074728_bxx006C8","first-page":"1","article-title":"A block lanczos with warm start technique for accelerating nuclear norm minimization algorithms","volume":"1","year":"2010","journal-title":"Mathematics"},{"year":"2010","key":"key\n\t\t\t\t20171108074728_bxx006C9"},{"key":"key\n\t\t\t\t20171108074728_bxx006C10","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1137\/100807697","article-title":"Inexact alternating direction methods for image recovery","volume":"33","year":"2011","journal-title":"SIAM J. Sci. Comput."},{"key":"key\n\t\t\t\t20171108074728_bxx006C11","first-page":"167","article-title":"Sparse and low-rank matrix decomposition via alternating direction methods","volume":"9","year":"2014","journal-title":"Pac. J.Optim"},{"year":"2014","key":"key\n\t\t\t\t20171108074728_bxx006C12"},{"key":"key\n\t\t\t\t20171108074728_bxx006C13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.patcog.2012.07.003","article-title":"A fast tri-factorization method for low-rank matrix recovery and completion","volume":"46","year":"2013","journal-title":"Pattern Recognit."},{"key":"key\n\t\t\t\t20171108074728_bxx006C14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.patcog.2012.06.011","article-title":"An efficient matrix factorization based low-rank representation for subspace clustering","volume":"46","year":"2013","journal-title":"Pattern Recognit."},{"key":"key\n\t\t\t\t20171108074728_bxx006C15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/10556788.2012.700713","article-title":"Augmented Lagrangian Alternating Direction Method for Matrix Separation based on Low-Rank Factorization","volume":"29","year":"2014","journal-title":"Optim. Methods Softw."},{"year":"2009","author":"TR10-07","key":"key\n\t\t\t\t20171108074728_bxx006C16"},{"year":"2009","author":"TR11-02","key":"key\n\t\t\t\t20171108074728_bxx006C17"},{"key":"key\n\t\t\t\t20171108074728_bxx006C18","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","article-title":"Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm","volume":"4","year":"2012","journal-title":"Math. Program. Comput."},{"key":"key\n\t\t\t\t20171108074728_bxx006C19","doi-asserted-by":"crossref","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","article-title":"Parallel matrix factorization for low-rank tensor completion","volume":"9","year":"2015","journal-title":"Inverse Probl. Imag."},{"year":"2012","key":"key\n\t\t\t\t20171108074728_bxx006C20"},{"key":"key\n\t\t\t\t20171108074728_bxx006C21","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.neucom.2014.03.046","article-title":"Linear time principal component pursuit and its extensions using \u2113 1, filtering","volume":"142","year":"2014","journal-title":"Neurocomputing."},{"key":"key\n\t\t\t\t20171108074728_bxx006C22","first-page":"1","article-title":"Kernel Nystr\u00f6m method for light transport","volume":"28","year":"2009","journal-title":"ACM Trans. Grap."},{"key":"key\n\t\t\t\t20171108074728_bxx006C23","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","article-title":"Recovering low-rank matrices from few coefficients in any basis","volume":"57","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"year":"2012","key":"key\n\t\t\t\t20171108074728_bxx006C24"},{"key":"key\n\t\t\t\t20171108074728_bxx006C25","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.cviu.2013.11.009","article-title":"Robust PCA via principal component pursuit: a review for a comparative evaluation in video surveillance, special issue on background models challenge","volume":"122","year":"2014","journal-title":"Comput. Vis. Image Underst."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/60\/11\/1609\/21611521\/bxx006.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T07:48:18Z","timestamp":1510127298000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/60\/11\/1609\/2990263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,13]]},"references-count":25,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2017,2,13]]},"published-print":{"date-parts":[[2017,11,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxx006","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2017,11]]},"published":{"date-parts":[[2017,2,13]]}}}