{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:50:44Z","timestamp":1740160244434,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:00:00Z","timestamp":1574380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:00:00Z","timestamp":1574380800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11301021"],"award-info":[{"award-number":["11301021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11571031"],"award-info":[{"award-number":["11571031"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. &amp; Cyber."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s13042-019-01039-9","type":"journal-article","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T07:03:48Z","timestamp":1574406228000},"page":"1293-1305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["GRPCA21 for recovering a corrupted low-rank matrix"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0876-5844","authenticated-orcid":false,"given":"Lina","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuke","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"1039_CR1","first-page":"28","volume-title":"Introduction to Machine Learning (Adaptive Computation and Machine Learning) [M]. Introduction to machine learning","author":"E Alpaydin","year":"2004","unstructured":"Alpaydin E (2004) Introduction to Machine Learning (Adaptive Computation and Machine Learning) [M]. Introduction to machine learning. MIT, Oxford, p 28"},{"key":"1039_CR2","unstructured":"Chong P, Kang Z, Yang M et al (2016) RAP: scalable RPCA for low-rank matrix recovery[C]. In: Proceedings of the 2016 ACM conference on information and knowledge management, pp. 2113\u20132118"},{"issue":"3","key":"1039_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cands","year":"2011","unstructured":"Cands EJ, Li X, Ma Y et al (2011) Robust principal component analysis? [J]. JACM 58(3):1\u201337","journal-title":"JACM"},{"issue":"6","key":"1039_CR4","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cands","year":"2009","unstructured":"Cands EJ, Recht B (2009) Exact matrix completion via convex optimization[J]. Found Comput Math 9(6):717\u2013772","journal-title":"Found Comput Math"},{"key":"1039_CR5","unstructured":"Wright J, Ganesh A, Rao S et al (2009) Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization[C]. In: Advances in neural information processing systems, pp 2080\u20132088"},{"key":"1039_CR6","unstructured":"Lin Z, Chen M, Ma Y (2010) The Augmented Lagrange Multiplier method for exact recovery of corrupted low-rank matrices [J]. Eprint Arxiv, p 9"},{"issue":"3","key":"1039_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht B, Fazel M, Parrilo P (2010) Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization [J]. SIAM Rev 52(3):471\u2013501","journal-title":"SIAM Rev"},{"issue":"9","key":"1039_CR8","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2013","unstructured":"Hu Y, Zhang D, Li X et al (2013) Fast and Accurate Matrix Completion via Truncated Nuclear Norm Regularization [J]. IEEE Trans. on Pattern Analysis and Machine Intelligence 35(9):2117\u20132130","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"1039_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TPAMI.2017.2651816","volume":"40","author":"Z Lin","year":"2018","unstructured":"Lin Z, Xu C, Zha H (2018) Robust matrix factorization by majorization minimization [J]. IEEE Trans Pattern Anal Mach Intell 40(1):208\u2013220","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"1039_CR10","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1007\/s13042-018-0814-9","volume":"10","author":"W Qian","year":"2019","unstructured":"Qian W, Cao F (2019) Adaptive algorithms for low-rank and sparse matrix recovery with truncated nuclear norm [J]. Int J Mach Learn Cybern 10(6):1341\u20131355","journal-title":"Int J Mach Learn Cybern"},{"issue":"11","key":"1039_CR11","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1007\/s00371-018-1555-1","volume":"35","author":"Z Xue","year":"2019","unstructured":"Xue Z, Dong J, Zhao Y et al (2019) Low-rank and sparse matrix decomposition via the truncated nuclear norm and a sparse regularizer [J]. Vis Comput 35(11):1549\u20131566","journal-title":"Vis Comput"},{"issue":"3","key":"1039_CR12","first-page":"123","volume":"44","author":"J Li","year":"2017","unstructured":"Li J, Zhao LN, Hou XK (2017) Matrix recovery by randomly permuted alternating direction method of multipliers[J]. J Beijing Univ Chem Technol 44(3):123\u2013128","journal-title":"J Beijing Univ Chem Technol"},{"key":"1039_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2019.07.012","author":"JX Zhao","year":"2019","unstructured":"Zhao JX, Zhao LN (2019) Low-rank and sparse matrices fitting algorithm for low-rank representation. Comput Math Appl. https:\/\/doi.org\/10.1016\/j.camwa.2019.07.012","journal-title":"Comput Math Appl"},{"issue":"3","key":"1039_CR14","first-page":"707","volume":"56","author":"Z Lin","year":"2009","unstructured":"Lin Z, Ganesh A, Wright J et al (2009) Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix [J]. CAMSAP 56(3):707\u2013722","journal-title":"CAMSAP"},{"key":"1039_CR15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-94-017-9054-3_4","volume-title":"On alternating direction methods of multipliers: a historical perspective [M]. Modeling, simulation and optimization for science and technology","author":"R Glowinski","year":"2014","unstructured":"Glowinski R (2014) On alternating direction methods of multipliers: a historical perspective [M]. Modeling, simulation and optimization for science and technology. Springer, Netherlands, pp 59\u201382"},{"key":"1039_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s11075-018-0630-z","volume":"82","author":"JX Zhao","year":"2019","unstructured":"Zhao JX, Feng Q, Zhao LN (2019) Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization[J]. Num Algorithms 82:371\u2013396","journal-title":"Num Algorithms"},{"key":"1039_CR17","doi-asserted-by":"crossref","unstructured":"Li J, Zhao L, Zhang M et al (2017) Low rank matrix recovery from sparse noise by 2,1 loss function[C]. In: IEEE International conference on signal & image processing","DOI":"10.1109\/SIPROCESS.2016.7888331"},{"issue":"10","key":"1039_CR18","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1109\/TPAMI.2015.2400461","volume":"37","author":"Z Li","year":"2015","unstructured":"Li Z, Liu J, Tang J et al (2015) Robust structured subspace learning for data representation[J]. IEEE Trans Pattern Anal Mach Intell 37(10):2085\u20132098","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1039_CR19","unstructured":"Sun R, Luo ZQ, Ye Y (2015) On the expected convergence of randomly permuted ADMM [J]. Mathematics. arXiv:1503.06387"},{"key":"1039_CR20","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.neucom.2018.10.012","volume":"323","author":"Y Li","year":"2018","unstructured":"Li Y, Liu G, Liu Q et al (2018) Moving object detection via segmentation and saliency constrained RPCA [J]. Neurocomputing 323:352\u2013362","journal-title":"Neurocomputing"},{"issue":"6","key":"1039_CR21","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.1007\/s13042-016-0562-7","volume":"8","author":"G Han","year":"2017","unstructured":"Han G, Wang J, Cai X (2017) Background subtraction based on modified online robust principal component analysis [J]. Int J Mach Learn Cybern 8(6):1839\u20131852","journal-title":"Int J Mach Learn Cybern"},{"issue":"8","key":"1039_CR22","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1109\/JPROC.2018.2853589","volume":"106","author":"T Bouwmans","year":"2018","unstructured":"Bouwmans T et al (2018) On the applications of robust PCA in image and video processing. Proc IEEE 106(8):1427\u20131457","journal-title":"Proc IEEE"},{"issue":"2","key":"1039_CR23","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s11263-016-0930-5","volume":"121","author":"S Gu","year":"2017","unstructured":"Gu S, Xie Q, Meng D et al (2017) Weighted nuclear norm minimization and its applications to low level vision [J]. Int J Comput Vis 121(2):183\u2013208","journal-title":"Int J Comput Vis"},{"issue":"5","key":"1039_CR24","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cands","year":"2010","unstructured":"Cands EJ, Tao T (2010) The power of convex relaxation: near-optimal matrix completion [J]. IEEE Trans Inf Theory 56(5):2053\u20132080","journal-title":"IEEE Trans Inf Theory"},{"key":"1039_CR25","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.neucom.2018.05.078","volume":"311","author":"Y Deng","year":"2018","unstructured":"Deng Y et al (2018) Nuclear norm-based matrix regression preserving embedding for face recognition [J]. Neurocomputing 311:279\u2013290","journal-title":"Neurocomputing"},{"issue":"9","key":"1039_CR26","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1016\/j.patcog.2006.03.013","volume":"39","author":"X Tan","year":"2006","unstructured":"Tan X, Chen S, Zhou ZH et al (2006) Face recognition from a single image per person: a survey [J]. Pattern Recog 39(9):1725\u20131745","journal-title":"Pattern Recog"},{"key":"1039_CR27","doi-asserted-by":"crossref","unstructured":"Dolhansky Brian, Ferrer Cristian Canton (2018) Eye in-painting with exemplar Generative Adversarial Networks [C]. CVPR","DOI":"10.1109\/CVPR.2018.00824"},{"issue":"8","key":"1039_CR28","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1364\/JOSAA.14.001724","volume":"14","author":"K Etemad","year":"1997","unstructured":"Etemad K, Chellappa R (1997) Discriminant analysis for recognition of human face images [J]. J. Opt. Soc. Am. A 14(8):1724\u20131733","journal-title":"J. Opt. Soc. Am. A"},{"key":"1039_CR29","unstructured":"Guo G, Li SZ, Chan K (March 2000) Face recognition by support vector machines[C]. Proc. of the IEEE Int. Conf. on Automatic Face and Gesture Recognition, 196-201"},{"issue":"5500","key":"1039_CR30","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding [J]. Science 290(5500):2323\u20132326","journal-title":"Science"},{"issue":"2","key":"1039_CR31","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright J, Yang AY, Ganesh A et al (2009) Robust face recognition via sparse representation [J]. IEEE Trans. Pattern Anal. Mach. Intell. 31(2):210\u2013227","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-019-01039-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-019-01039-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-019-01039-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T06:49:27Z","timestamp":1695451767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-019-01039-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,22]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["1039"],"URL":"https:\/\/doi.org\/10.1007\/s13042-019-01039-9","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2019,11,22]]},"assertion":[{"value":"4 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}