{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:33:53Z","timestamp":1787322833326,"version":"build-2736575974"},"reference-count":62,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2011140"],"award-info":[{"award-number":["DMS-2011140"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2108479"],"award-info":[{"award-number":["DMS-2108479"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2304489"],"award-info":[{"award-number":["DMS-2304489"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Imaging Sci."],"published-print":{"date-parts":[[2024,3,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>We study the tensor robust principal component analysis (TRPCA) problem, a tensorial extension of matrix robust principal component analysis, which aims to split the given tensor into an underlying low-rank component and a sparse outlier component. This work proposes a fast algorithm, called robust tensor CUR decompositions (RTCUR), for large-scale nonconvex TRPCA problems under the Tucker rank setting. RTCUR is developed within a framework of alternating projections that projects between the set of low-rank tensors and the set of sparse tensors. We utilize the recently developed tensor CUR decomposition to substantially reduce the computational complexity in each projection. In addition, we develop four variants of RTCUR for different application settings. We demonstrate the effectiveness and computational advantages of RTCUR against state-of-the-art methods on both synthetic and real-world datasets.<\/jats:p>","DOI":"10.1137\/23m1574282","type":"journal-article","created":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T04:44:30Z","timestamp":1706157870000},"page":"225-247","source":"Crossref","is-referenced-by-count":15,"title":["Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruptions"],"prefix":"10.1137","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2937-1986","authenticated-orcid":true,"given":"HanQin","family":"Cai","sequence":"first","affiliation":[{"name":"Department of Statistics and Data Science and Department of Computer Science, University of Central Florida, Orlando, FL 32816 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zehan","family":"Chao","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of California, Los Angeles, Los Angeles, CA 90095 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Longxiu","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Computational Mathematics, Science, and Engineering and Department of Mathematics, Michigan State University, East Lansing, MI 48823 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8058-8638","authenticated-orcid":true,"given":"Deanna","family":"Needell","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of California, Los Angeles, Los Angeles, CA 90095 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2024,1,25]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/wics.101"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.936030"},{"key":"ref3","doi-asserted-by":"crossref","unstructured":"T. Bouwmans , \nS. Javed , \nH. Zhang , \nZ. Lin , and \nR. Otazo  , On the applications of robust PCA in image and video processing, Proc. IEEE, 106 (2018), pp. 1427\u20131457.","DOI":"10.1109\/JPROC.2018.2853589"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.12.024"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3049618"},{"key":"ref6","first-page":"685","volume":"20","author":"Cai H.","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/22M1491009"},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"H. Cai , \nZ. Chao , \nL. Huang , and \nD. Needell  , Fast robust tensor principal component analysis via Fiber CUR decomposition, in Proceedings of the IEEE\/CVF International Conference on Computer Vision Workshops, IEEE, New York, 2021, pp. 189\u2013197.","DOI":"10.1109\/ICCVW54120.2021.00026"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2020.3044130"},{"key":"ref10","first-page":"1","volume":"22","author":"Cai H.","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/20M1388322"},{"key":"ref12","unstructured":"H. Cai , \nJ. Liu , and \nW. Yin  , Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection, preprint, arXiv:2110.05649, 2021."},{"key":"ref13","author":"Cai J.-F.","year":"2022","journal-title":"J. Amer. Statist. Assoc."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.03.020"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/23\/3\/008"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.07.059"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3390\/jimaging7070110"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/070711621"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898346995"},{"key":"ref23","first-page":"iaad019","volume":"12","author":"Dong H.","year":"2023","journal-title":"Inf. Inference"},{"key":"ref24","first-page":"151","volume":"343","author":"Gore\u012dnov S. A.","year":"1995","journal-title":"Dokl. Akad. Nauk"},{"key":"ref25","first-page":"1422","volume":"27","author":"Gu Q.","year":"2014","journal-title":"Adv. Neural Inform. Process. Syst."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2019.08.006"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3934\/fods.2020006"},{"key":"ref28","first-page":"152","volume-title":"Topological, Algebraic and Geometric Learning Workshops 2022","author":"Hamm K.","year":"2022"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/sapm19287139"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2019.2943459"},{"key":"ref31","first-page":"1","volume":"15","author":"Hu Y.","year":"2020","journal-title":"ACM Trans. Knowledge Discovery Data"},{"key":"ref32","first-page":"455","volume":"4252","author":"Huang B.","year":"2014","journal-title":"Optim. Online"},{"key":"ref33","first-page":"1779","volume":"10","author":"Ji P.","year":"2016","journal-title":"Ann. Appl. Stat."},{"key":"ref34","unstructured":"E. Lopez-Rubio  , Foreground detection in video sequences with probabilistic self-organizing maps, http:\/\/www.lcc.uma.es\/\u223cezeqlr\/fsom\/fsom.html."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.836169"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s12561-018-9215-6"},{"key":"ref38","doi-asserted-by":"crossref","unstructured":"Z. Lin  and \nH. Zhang  , Low-Rank Models in Visual Analysis, Elsevier, New York, 2017, pp. 1\u20132.","DOI":"10.1016\/B978-0-12-812731-5.00001-9"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref40","first-page":"1","author":"Liu T.","year":"2022","journal-title":"Statist. Biosci."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2873142"},{"key":"ref42","doi-asserted-by":"crossref","unstructured":"C. Lu , \nJ. Feng , \nY. Chen , \nW. Liu , \nZ. Lin , and \nS. Yan  , Tensor robust principal component analysis: Exact recovery of corrupted low-rank tensors via convex optimization, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, IEEE, New York, 2016, pp. 5249\u20135257.","DOI":"10.1109\/CVPR.2016.567"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2891760"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.01.004"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1093\/jamia\/ocv016"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/060665336"},{"key":"ref47","doi-asserted-by":"crossref","unstructured":"M. M. Salut  and \nD. Anderson  , Randomized Tensor Robust Principal Component Analysis, TechRxiv, 2022.","DOI":"10.36227\/techrxiv.21743840.v1"},{"key":"ref48","volume-title":"Advances in Neural Information Processing Systems","volume":"27","author":"Netrapalli P.","year":"2014"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995586"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.90"},{"key":"ref51","unstructured":"S. Rabanser , \nO. Shchur , and \nS. G\u00fcnnemann  , Introduction to Tensor Decompositions and Their Applications in Machine Learning, preprint, arXiv:1711.10781, 2017."},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.140"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2018.8450832"},{"key":"ref54","doi-asserted-by":"crossref","unstructured":"T. Song , \nZ. Peng , \nS. Wang , \nW. Fu , \nX. Hong , and \nP. S. Yu  , Based cross-domain recommendation through joint tensor factorization, in International Conference on Database Systems for Advanced Applications, Springer-Verlag, Berlin, 2017, pp. 525\u2013540.","DOI":"10.1007\/978-3-319-55753-3_33"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref56","doi-asserted-by":"crossref","unstructured":"N. Vaswani  and \nP. Narayanamurthy  , Static and dynamic robust PCA and matrix completion: A review, Proc. IEEE, 106 (2018), pp. 1359\u20131379.","DOI":"10.1109\/JPROC.2018.2844126"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1942"},{"key":"ref59","doi-asserted-by":"crossref","unstructured":"Z. Zhang , \nG. Ely , \nS. Aeron , \nN. Hao , and \nM. Kilmer  , Novel methods for multilinear data completion and de-noising based on tensor-SVD, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, IEEE, New York, 2014, pp. 3842\u20133849.","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.08.042"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2013.776499"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2762595"}],"container-title":["SIAM Journal on Imaging Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/23M1574282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:28:15Z","timestamp":1787318895000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1574282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,25]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,31]]}},"alternative-id":["10.1137\/23M1574282"],"URL":"https:\/\/doi.org\/10.1137\/23m1574282","relation":{},"ISSN":["1936-4954"],"issn-type":[{"value":"1936-4954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,25]]}}}