{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:52:17Z","timestamp":1761648737252},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030414030"},{"type":"electronic","value":"9783030414047"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41404-7_30","type":"book-chapter","created":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T07:02:58Z","timestamp":1582354978000},"page":"424-437","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Factorization Strategy for Tensor Robust PCA"],"prefix":"10.1007","author":[{"given":"Andong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,23]]},"reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? JACM 58(3), 11 (2011)","journal-title":"JACM"},{"key":"30_CR2","unstructured":"Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis, Stanford University (2002)"},{"key":"30_CR3","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.: A Mathematical Introduction to Compressive Sensing, vol. 1. Birkh\u00e4user, Basel (2013)"},{"issue":"311","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1090\/mcom\/3239","volume":"87","author":"S Friedland","year":"2017","unstructured":"Friedland, S., Lim, L.: Nuclear norm of higher-order tensors. Math. Comput. 87(311), 1255\u20131281 (2017)","journal-title":"Math. Comput."},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/130905010","volume":"35","author":"D Goldfarb","year":"2014","unstructured":"Goldfarb, D., Qin, Z.: Robust low-rank tensor recovery: models and algorithms. SIAM J. Matrix Anal. Appl. 35(1), 225\u2013253 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"30_CR6","unstructured":"Harshman, R.A.: Foundations of the PARAFAC procedure: models and conditions for an \u201cexplanatory\u201d multi-modal factor analysis (1970)"},{"issue":"6","key":"30_CR7","first-page":"45","volume":"60","author":"CJ Hillar","year":"2009","unstructured":"Hillar, C.J., Lim, L.: Most tensor problems are NP-hard. J. ACM 60(6), 45 (2009)","journal-title":"J. ACM"},{"issue":"2","key":"30_CR8","first-page":"339","volume":"11","author":"B Huang","year":"2015","unstructured":"Huang, B., Mu, C., Goldfarb, D., Wright, J.: Provable models for robust low-rank tensor completion. Pac. J. Optim. 11(2), 339\u2013364 (2015)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/110837711","volume":"34","author":"ME Kilmer","year":"2013","unstructured":"Kilmer, M.E., Braman, K., Hao, N., Hoover, R.C.: 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 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"30_CR10","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.: Tensor completion for estimating missing values in visual data. IEEE TPAMI 35(1), 208\u2013220 (2013)","journal-title":"IEEE TPAMI"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., Yan, S.: Tensor robust principal component analysis: exact recovery of corrupted low-rank tensors via convex optimization. In: CVPR, pp. 5249\u20135257 (2016)","DOI":"10.1109\/CVPR.2016.567"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Lu, C., Feng, J., Liu, W., Lin, Z., Yan, S., et al.: Tensor robust principal component analysis with a new tensor nuclear norm. IEEE TPAMI (2019)","DOI":"10.1109\/TPAMI.2019.2891760"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Moosmann, F., Stiller, C.: Joint self-localization and tracking of generic objects in 3D range data. In: ICRA, pp. 1138\u20131144. Karlsruhe, Germany, May 2013","DOI":"10.1109\/ICRA.2013.6630716"},{"key":"30_CR14","unstructured":"Romera-Paredes, B., Pontil, M.: A new convex relaxation for tensor completion. In: NIPS, pp. 2967\u20132975 (2013)"},{"issue":"3","key":"30_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L.R.: Some mathematical notes on three-mode factor analysis. Psychometrika 31(3), 279\u2013311 (1966)","journal-title":"Psychometrika"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Wang, A., Jin, Z.: Near-optimal noisy low-tubal-rank tensor completion via singular tube thresholding. In: ICDM Workshop, pp. 553\u2013560 (2017)","DOI":"10.1109\/ICDMW.2017.78"},{"key":"30_CR17","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.: Noisy low-tubal-rank tensor completion. Neurocomputing 330, 267\u2013279 (2019)","journal-title":"Neurocomputing"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"35112","DOI":"10.1109\/ACCESS.2018.2850324","volume":"6","author":"A Wang","year":"2018","unstructured":"Wang, A., Wei, D., Wang, B., Jin, Z.: Noisy low-tubal-rank tensor completion through iterative singular tube thresholding. IEEE Access 6, 35112\u201335128 (2018)","journal-title":"IEEE Access"},{"issue":"8","key":"30_CR19","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1109\/LSP.2018.2849590","volume":"25","author":"T Wu","year":"2018","unstructured":"Wu, T., Bajwa, W.U.: A low tensor-rank representation approach for clustering of imaging data. IEEE Signal Process. Lett. 25(8), 1196\u20131200 (2018)","journal-title":"IEEE Signal Process. Lett."},{"issue":"11","key":"30_CR20","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.: On unifying multi-view self-representations for clustering by tensor multi-rank minimization. Int. J. Comput. Vis. 126(11), 1157\u20131179 (2018)","journal-title":"Int. J. Comput. Vis."},{"issue":"2","key":"30_CR21","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.: Parallel matrix factorization for low-rank tensor completion. Inverse Prob. Imaging 9(2), 601\u2013624 (2015)","journal-title":"Inverse Prob. Imaging"},{"issue":"6","key":"30_CR22","first-page":"1511","volume":"65","author":"Z Zhang","year":"2017","unstructured":"Zhang, Z., Aeron, S.: Exact tensor completion using T-SVD. IEEE TSP 65(6), 1511\u20131526 (2017)","journal-title":"IEEE TSP"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Ely, G., Aeron, S., Hao, N., Kilmer, M.: Novel methods for multilinear data completion and de-noising based on tensor-SVD. In: CVPR, pp. 3842\u20133849 (2014)","DOI":"10.1109\/CVPR.2014.485"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Zhou, P., Feng, J.: Outlier-robust tensor PCA. In: CVPR (2017)","DOI":"10.1109\/CVPR.2017.419"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41404-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T07:09:56Z","timestamp":1582355396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41404-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030414030","9783030414047"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41404-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acpr2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.acpr2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"214","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"for ACPR 2019 Workshops volume accepted 17 full papers and 6 short papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}