{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T20:09:47Z","timestamp":1768766987420,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872188"],"award-info":[{"award-number":["61872188"]}],"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":"crossref","award":["U1713208"],"award-info":[{"award-number":["U1713208"]}],"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":["61972204"],"award-info":[{"award-number":["61972204"]}],"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":["61672287"],"award-info":[{"award-number":["61672287"]}],"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":["61861136011"],"award-info":[{"award-number":["61861136011"]}],"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":["61773215"],"award-info":[{"award-number":["61773215"]}],"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":["61703209"],"award-info":[{"award-number":["61703209"]}],"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":["61972212"],"award-info":[{"award-number":["61972212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2020A1515010671"],"award-info":[{"award-number":["2020A1515010671"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2017A030313367"],"award-info":[{"award-number":["2017A030313367"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20190089"],"award-info":[{"award-number":["BK20190089"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s13042-020-01150-2","type":"journal-article","created":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T11:02:48Z","timestamp":1592996568000},"page":"2771-2791","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A faster tensor robust PCA via tensor factorization"],"prefix":"10.1007","volume":"11","author":[{"given":"An-Dong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4293-0869","authenticated-orcid":false,"given":"Zhong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing-Yu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"issue":"1","key":"1150_CR1","first-page":"1","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd S, Parikh N, Chu E, Peleato B, Eckstein J (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae. Mach Learn 3(1):1\u2013122","journal-title":"Mach Learn"},{"issue":"3","key":"1150_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s EJ, Li X, Ma Y, Wright J (2011) Robust principal component analysis? J ACM (JACM) 58(3):11","journal-title":"J ACM (JACM)"},{"issue":"5","key":"1150_CR3","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s EJ, Tao T (2010) The power of convex relaxation: near-optimal matrix completion. IEEE Trans Inf Theory 56(5):2053\u20132080","journal-title":"IEEE Trans Inf Theory"},{"key":"1150_CR4","unstructured":"Fazel M (2002) Matrix rank minimization with applications. Ph.D. thesis, Stanford University"},{"key":"1150_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A mathematical introduction to compressive sensing","author":"S Foucart","year":"2013","unstructured":"Foucart S, Rauhut H (2013) A mathematical introduction to compressive sensing, vol 1. Birkh\u00e4user, Basel"},{"issue":"311","key":"1150_CR6","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1090\/mcom\/3239","volume":"87","author":"S Friedland","year":"2017","unstructured":"Friedland S, Lim L (2017) Nuclear norm of higher-order tensors. Math Comput 87(311):1255\u20131281","journal-title":"Math Comput"},{"issue":"1","key":"1150_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/130905010","volume":"35","author":"D Goldfarb","year":"2014","unstructured":"Goldfarb D, Qin Z (2014) Robust low-rank tensor recovery: models and algorithms. SIAM J Matrix Anal Appl 35(1):225\u2013253","journal-title":"SIAM J Matrix Anal Appl"},{"key":"1150_CR8","unstructured":"Harshman RA (1970) Foundations of the parafac procedure: models and conditions for an \u201cexplanatory\u201d multi-modal factor analysis"},{"issue":"6","key":"1150_CR9","first-page":"45","volume":"60","author":"CJ Hillar","year":"2009","unstructured":"Hillar CJ, Lim L (2009) Most tensor problems are np-hard. J ACM 60(6):45","journal-title":"J ACM"},{"issue":"2","key":"1150_CR10","first-page":"339","volume":"11","author":"B Huang","year":"2015","unstructured":"Huang B, Mu C, Goldfarb D, Wright J (2015) Provable models for robust low-rank tensor completion. Pac J Optim 11(2):339\u2013364","journal-title":"Pac J Optim"},{"key":"1150_CR11","doi-asserted-by":"crossref","unstructured":"Jiang Q, Ng M (2019) Robust low-tubal-rank tensor completion via convex optimization. In: Proceedings of the 28th international joint conference on artificial intelligence. AAAI Press, Macao, China, pp 2649\u20132655","DOI":"10.24963\/ijcai.2019\/368"},{"issue":"1","key":"1150_CR12","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/110837711","volume":"34","author":"ME Kilmer","year":"2013","unstructured":"Kilmer ME, Braman K, Hao N, Hoover RC (2013) Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging. SIAM J Matrix Anal Appl 34(1):148\u2013172","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3","key":"1150_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51(3):455\u2013500","journal-title":"SIAM Rev"},{"issue":"10","key":"1150_CR14","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1109\/TNNLS.2013.2297381","volume":"25","author":"Z Lai","year":"2014","unstructured":"Lai Z, Xu Y, Chen Q, Yang J, Zhang D (2014) Multilinear sparse principal component analysis. IEEE Trans Neural Netw 25(10):1942\u20131950","journal-title":"IEEE Trans Neural Netw"},{"issue":"10","key":"1150_CR15","doi-asserted-by":"publisher","first-page":"3904","DOI":"10.1109\/TIP.2013.2264678","volume":"22","author":"Z Lai","year":"2013","unstructured":"Lai Z, Xu Y, Yang J, Tang J, Zhang D (2013) Sparse tensor discriminant analysis. IEEE Trans Image Process 22(10):3904\u20133915","journal-title":"IEEE Trans Image Process"},{"key":"1150_CR16","unstructured":"Lin Z, Chen M, Ma Y (2010) The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv preprint arXiv:1009.5055"},{"issue":"12","key":"1150_CR17","doi-asserted-by":"publisher","first-page":"3371","DOI":"10.1162\/NECO_a_00369","volume":"24","author":"G Liu","year":"2012","unstructured":"Liu G, Yan S (2012) Active subspace: toward scalable low-rank learning. Neural Comput 24(12):3371\u20133394","journal-title":"Neural Comput"},{"issue":"1","key":"1150_CR18","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","volume":"35","author":"J Liu","year":"2013","unstructured":"Liu J, Musialski P, Wonka P, Ye J (2013) Tensor completion for estimating missing values in visual data. IEEE Trans Pattern Anal Mach Intell 35(1):208\u2013220","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"1150_CR19","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1109\/TIT.2019.2959980","volume":"66","author":"X Liu","year":"2020","unstructured":"Liu X, Aeron S, Aggarwal V, Wang X (2020) Low-tubal-rank tensor completion using alternating minimization. IEEE Trans Inf Theory 66(3):1714\u20131737","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"1150_CR20","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.patcog.2012.07.003","volume":"46","author":"Y Liu","year":"2013","unstructured":"Liu Y, Jiao L, Shang F (2013) A fast tri-factorization method for low-rank matrix recovery and completion. Pattern Recognit 46(1):163\u2013173","journal-title":"Pattern Recognit"},{"key":"1150_CR21","doi-asserted-by":"publisher","first-page":"107456","DOI":"10.1016\/j.sigpro.2020.107456","volume":"170","author":"Z Liu","year":"2020","unstructured":"Liu Z, Lai Z, Ou W, Zhang K, Zheng R (2020) Structured optimal graph based sparse feature extraction for semi-supervised learning. Signal Process 170:107456","journal-title":"Signal Process"},{"key":"1150_CR22","doi-asserted-by":"publisher","first-page":"105768","DOI":"10.1016\/j.asoc.2019.105768","volume":"85","author":"Z Liu","year":"2019","unstructured":"Liu Z, Wang J, Liu G, Zhang L (2019) Discriminative low-rank preserving projection for dimensionality reduction. Appl Soft Comput 85:105768","journal-title":"Appl Soft Comput"},{"key":"1150_CR23","doi-asserted-by":"crossref","unstructured":"Lu C, Feng J, Chen Y, Liu W, Lin Z, Yan S (2016) 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, Las Vegas, USA, pp 5249-5257","DOI":"10.1109\/CVPR.2016.567"},{"key":"1150_CR24","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TPAMI.2019.2891760","volume":"42","author":"C Lu","year":"2019","unstructured":"Lu C, Feng J, Liu W, Lin Z, Yan S et al (2019) Tensor robust principal component analysis with a new tensor nuclear norm. IEEE Trans Pattern Anal Mach Intell 42:925\u2013938","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1150_CR25","doi-asserted-by":"crossref","unstructured":"Moosmann F, Stiller C (2013) Joint self-localization and tracking of generic objects in 3d range data. In: Proceedings of the IEEE international conference on robotics and automation. IEEE, Karlsruhe, Germany, pp 1138\u20131144","DOI":"10.1109\/ICRA.2013.6630716"},{"key":"1150_CR26","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.neucom.2016.05.113","volume":"261","author":"Y Peng","year":"2017","unstructured":"Peng Y, Lu BL (2017) Discriminative extreme learning machine with supervised sparsity preserving for image classification. Neurocomputing 261:242\u2013252","journal-title":"Neurocomputing"},{"issue":"6","key":"1150_CR27","doi-asserted-by":"publisher","first-page":"8859","DOI":"10.1007\/s11042-016-3510-3","volume":"76","author":"Y Peng","year":"2017","unstructured":"Peng Y, Lu BL (2017) Robust structured sparse representation via half-quadratic optimization for face recognition. Multimed Tools Appl 76(6):8859\u20138880","journal-title":"Multimed Tools Appl"},{"key":"1150_CR28","unstructured":"Romera-Paredes B, Pontil M (2013) A new convex relaxation for tensor completion. In: Proceedings of advances in neural information processing systems. The Neural Information Processing Systems Foundation, Lake Tahoe, USA, pp 2967\u20132975"},{"issue":"3","key":"1150_CR29","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker LR (1966) Some mathematical notes on three-mode factor analysis. Psychometrika 31(3):279\u2013311","journal-title":"Psychometrika"},{"key":"1150_CR30","doi-asserted-by":"crossref","unstructured":"Wang A, Jin Z (2017) Near-optimal noisy low-tubal-rank tensor completion via singular tube thresholding. In: Proceedings of the IEEE international conference on data mining workshop (ICDMW). IEEE, New Orleans, USA, pp 553\u2013560","DOI":"10.1109\/ICDMW.2017.78"},{"key":"1150_CR31","doi-asserted-by":"publisher","first-page":"107319","DOI":"10.1016\/j.sigpro.2019.107319","volume":"167","author":"A Wang","year":"2020","unstructured":"Wang A, Jin Z, Tang G (2020) Robust tensor decomposition via t-SVD: near-optimal statistical guarantee and scalable algorithms. Signal Process 167:107319. https:\/\/doi.org\/10.1016\/j.sigpro.2019.107319","journal-title":"Signal Process"},{"key":"1150_CR32","doi-asserted-by":"crossref","unstructured":"Wang A, Jin Z, Yang J (2019) A factorization strategy for tensor robust PCA. In: 2019 5th IAPR Asian conference on pattern recognition (ACPR). IAPR, Auckland, New Zealand, pp 424\u2013437","DOI":"10.1007\/978-3-030-41404-7_30"},{"key":"1150_CR33","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.neucom.2018.11.012","volume":"330","author":"A Wang","year":"2019","unstructured":"Wang A, Lai Z, Jin Z (2019) Noisy low-tubal-rank tensor completion. Neurocomputing 330:267\u2013279","journal-title":"Neurocomputing"},{"key":"1150_CR34","doi-asserted-by":"crossref","unstructured":"Wang A, Li C, Jin Z, Zhao Q (2020) Robust tensor decomposition via orientation invariant tubal nuclear norms. In: Proceedings of AAAI conference on artiicial intelligence. AAAI Press, New York, USA, pp 6102\u20136109","DOI":"10.1609\/aaai.v34i04.6074"},{"issue":"4","key":"1150_CR35","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TIP.2003.819861","volume":"13","author":"Z Wang","year":"2004","unstructured":"Wang Z, Bovik AC, Sheikh HR, Simoncelli EP (2004) Image quality assessment: from error visibility to structural similarity. IEEE Trans Image Process 13(4):600\u2013612","journal-title":"IEEE Trans Image Process"},{"issue":"8","key":"1150_CR36","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1109\/LSP.2018.2849590","volume":"25","author":"T Wu","year":"2018","unstructured":"Wu T, Bajwa WU (2018) A low tensor-rank representation approach for clustering of imaging data. IEEE Signal Process Lett 25(8):1196\u20131200","journal-title":"IEEE Signal Process Lett"},{"issue":"11","key":"1150_CR37","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s11263-018-1086-2","volume":"126","author":"Y Xie","year":"2018","unstructured":"Xie Y, Tao D, Zhang W, Liu Y, Zhang L, Qu Y (2018) On unifying multi-view self-representations for clustering by tensor multi-rank minimization. Int J Comput Vis 126(11):1157\u20131179","journal-title":"Int J Comput Vis"},{"issue":"2","key":"1150_CR38","doi-asserted-by":"publisher","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","volume":"9","author":"Y Xu","year":"2015","unstructured":"Xu Y, Hao R, Yin W, Su Z (2015) Parallel matrix factorization for low-rank tensor completion. Inverse Probl Imaging 9(2):601\u2013624","journal-title":"Inverse Probl Imaging"},{"key":"1150_CR39","doi-asserted-by":"publisher","first-page":"49955","DOI":"10.1109\/ACCESS.2018.2868731","volume":"6","author":"J Xue","year":"2018","unstructured":"Xue J, Zhao Y, Liao W, Chan JCW (2018) Total variation and rank-1 constraint rpca for background subtraction. IEEE Access 6:49955\u201349966","journal-title":"IEEE Access"},{"key":"1150_CR40","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ins.2019.06.061","volume":"503","author":"J Xue","year":"2019","unstructured":"Xue J, Zhao Y, Liao W, Chan JCW (2019) Nonconvex tensor rank minimization and its applications to tensor recovery. Inf Sci 503:109\u2013128","journal-title":"Inf Sci"},{"key":"1150_CR41","doi-asserted-by":"publisher","unstructured":"Xue J, Zhao Y, Liao W, Chan JCW, Kong SG (2020) Enhanced sparsity prior model for low-rank tensor completion. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2019.2956153","DOI":"10.1109\/TNNLS.2019.2956153"},{"key":"1150_CR42","doi-asserted-by":"publisher","first-page":"5848","DOI":"10.1109\/ACCESS.2017.2779173","volume":"6","author":"F Zhang","year":"2018","unstructured":"Zhang F, Yang G, Yang Z, Wan M (2018) Robust recovery of corrupted image data based on $$l_{1-2}$$ metric. IEEE Access 6:5848\u20135855","journal-title":"IEEE Access"},{"issue":"6","key":"1150_CR43","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1109\/TSP.2016.2639466","volume":"65","author":"Z Zhang","year":"2017","unstructured":"Zhang Z, Aeron S (2017) Exact tensor completion using t-SVD. IEEE Trans Signal Process 65(6):1511\u20131526","journal-title":"IEEE Trans Signal Process"},{"key":"1150_CR44","doi-asserted-by":"crossref","unstructured":"Zhang Z, Ely G, Aeron S, Hao N, Kilmer M (2014) 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, Columbus, USA, pp 3842\u20133849","DOI":"10.1109\/CVPR.2014.485"},{"key":"1150_CR45","doi-asserted-by":"crossref","unstructured":"Zhou P, Feng J (2017) Outlier-robust tensor PCA. In: Proceedings of the IEEE conference on computer vision and pattern recognition. IEEE, Honolulu, USA, pp 3938\u20133946","DOI":"10.1109\/CVPR.2017.419"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01150-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-020-01150-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01150-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T00:19:17Z","timestamp":1624493957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-020-01150-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,24]]},"references-count":45,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1150"],"URL":"https:\/\/doi.org\/10.1007\/s13042-020-01150-2","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,24]]},"assertion":[{"value":"2 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}