{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T20:34:39Z","timestamp":1772742879825,"version":"3.50.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018AAA0101902"],"award-info":[{"award-number":["2018AAA0101902"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61936014"],"award-info":[{"award-number":["61936014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772427"],"award-info":[{"award-number":["61772427"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61751202"],"award-info":[{"award-number":["61751202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1801262"],"award-info":[{"award-number":["U1801262"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61871470"],"award-info":[{"award-number":["61871470"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["G2019KY0501"],"award-info":[{"award-number":["G2019KY0501"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2022,2,1]]},"DOI":"10.1109\/tpami.2020.3027968","type":"journal-article","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T20:41:35Z","timestamp":1601498495000},"page":"1081-1097","source":"Crossref","is-referenced-by-count":62,"title":["Truncated Robust Principle Component Analysis With A General Optimization Framework"],"prefix":"10.1109","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0871-6519","authenticated-orcid":false,"given":"Feiping","family":"Nie","sequence":"first","affiliation":[{"name":"School of Computer Science and Center for OPTical IMagery Analysis and Learning, Northwestern Polytechnical University, Xi'an, Shaanxi, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0309-1409","authenticated-orcid":false,"given":"Danyang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Center for OPTical IMagery Analysis and Learning, Northwestern Polytechnical University, Xi'an, Shaanxi, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9240-6726","authenticated-orcid":false,"given":"Rong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Cybersecurity and Center for OPTical IMagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi'an, Shaanxi, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2924-946X","authenticated-orcid":false,"given":"Xuelong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Center for OPTical IMagery Analysis and Learning, Northwestern Polytechnical University, Xi'an, Shaanxi, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04898-2_455"},{"key":"ref2","first-page":"66","article-title":"Dimensionality reduction: A comparative","volume":"10","author":"Van Der Maaten","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2010.5596721"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1991.139758"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-72201-1_4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2002.804287"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0959-1524(02)00016-1"},{"key":"ref8","first-page":"1","article-title":"A framework for robust subspace learning","volume":"54","author":"De La Torre","year":"2003","journal-title":"Int. J. Comput. Vis."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.244"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.08.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.09.023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2221728"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971408"},{"key":"ref14","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Wright"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2262286"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WACV.2015.78"},{"key":"ref17","article-title":"Robust subspace segmentation by low-rank representation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2103949"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1201\/9781315220147"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2016.2619184"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.309"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.114"},{"key":"ref23","first-page":"1433","article-title":"Robust principal component analysis with non-greedy L1-norm maximization","volume-title":"Proc. 22nd Int. Joint Conf. Artif. Intell.","author":"Nie"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2777184"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143880"},{"key":"ref26","first-page":"1062","article-title":"Optimal mean robust principal component analysis","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Nie"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref28","first-page":"1813","article-title":"Efficient and robust feature selection via joint L2, 1-norms minimization","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Nie"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10948"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1198\/0003130042836"},{"key":"ref31","article-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"Lin","year":"2010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.105"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219951"},{"key":"ref35","first-page":"2598","article-title":"Multi-view k-means clustering on big data","volume-title":"Proc. 23rd Int. Joint Conf. Artif. Intell.","author":"Cai"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2961877"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8210"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2876327"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974409"},{"issue":"2","key":"ref40","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1009715923555","article-title":"A tutorial on support vector machines for pattern recognition","volume":"2","author":"Burges","year":"1998","journal-title":"Data Mining Knowl. Discovery"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3379500"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/9674188\/09210008.pdf?arnumber=9210008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:35:17Z","timestamp":1704843317000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9210008\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":41,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2020.3027968","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,1]]}}}