{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T19:52:38Z","timestamp":1767383558151,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T00:00:00Z","timestamp":1527120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Natural Science Foundation of the Higher Education Institutions of Jiangsu Province of China","award":["17KJB510025"],"award-info":[{"award-number":["17KJB510025"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41676088"],"award-info":[{"award-number":["41676088"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Basic Research Program for National Security of China","award":["613317"],"award-info":[{"award-number":["613317"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00371-018-1555-1","type":"journal-article","created":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T02:41:06Z","timestamp":1527129666000},"page":"1549-1566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Low-rank and sparse matrix decomposition via the truncated nuclear norm and a sparse regularizer"],"prefix":"10.1007","volume":"35","author":[{"given":"Zhichao","family":"Xue","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0512-8105","authenticated-orcid":false,"given":"Jing","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Yuxin","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Chang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ryad","family":"Chellali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,24]]},"reference":[{"issue":"1","key":"1555_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"5","key":"1555_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00371-015-1075-1","volume":"32","author":"A Bhardwaj","year":"2016","unstructured":"Bhardwaj, A., Raman, S.: Robust PCA-based solution to image composition using augmented lagrange multiplier (ALM). Vis. Comput. 32(5), 591\u2013600 (2016)","journal-title":"Vis. Comput."},{"key":"1555_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2016.11.001","volume":"23","author":"T Bouwmans","year":"2017","unstructured":"Bouwmans, T., Sobral, A., Javed, S., Jung, S.K., Zahzah, E.H.: Decomposition into low-rank plus additive matrices for background\/foreground separation: a review for a comparative evaluation with a large-scale dataset. Comput. Sci. Rev. 23, 1\u201371 (2017)","journal-title":"Comput. Sci. Rev."},{"key":"1555_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.cviu.2013.11.009","volume":"122","author":"T Bouwmans","year":"2014","unstructured":"Bouwmans, T., Zahzah, E.H.: Robust PCA via principal component pursuit: a review for a comparative evaluation in video surveillance. Comput. Vis. Image Underst. 122, 22\u201334 (2014)","journal-title":"Comput. Vis. Image Underst."},{"issue":"1","key":"1555_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"4","key":"1555_CR6","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1555_CR7","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? J. ACM (JACM) 58(3), 11 (2011)","journal-title":"J. ACM (JACM)"},{"issue":"6","key":"1555_CR8","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717 (2009)","journal-title":"Found. Comput. Math."},{"key":"1555_CR9","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.neunet.2016.09.005","volume":"85","author":"F Cao","year":"2017","unstructured":"Cao, F., Chen, J., Ye, H., Zhao, J., Zhou, Z.: Recovering low-rank and sparse matrix based on the truncated nuclear norm. Neural Netw. 85, 10\u201320 (2017)","journal-title":"Neural Netw."},{"issue":"2","key":"1555_CR10","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., Willsky, A.S.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim. 21(2), 572\u2013596 (2011)","journal-title":"SIAM J. Optim."},{"key":"1555_CR11","unstructured":"Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis, Stanford University (2002)"},{"key":"1555_CR12","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.patcog.2017.02.017","volume":"67","author":"L Fei","year":"2017","unstructured":"Fei, L., Xu, Y., Fang, X., Yang, J.: Low rank representation with adaptive distance penalty for semi-supervised subspace classification. Pattern Recognit. 67, 252\u2013262 (2017)","journal-title":"Pattern Recognit."},{"key":"1555_CR13","doi-asserted-by":"publisher","unstructured":"Giraldo-Zuluaga, J.H., Salazar, A., Gomez, A., Diaz-Pulido, A.: Camera-trap images segmentation using multi-layer robust principal component analysis. Vis. Comput. (2017). \n                    https:\/\/doi.org\/10.1007\/s00371-017-1463-9","DOI":"10.1007\/s00371-017-1463-9"},{"issue":"1\u20132","key":"1555_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10107-012-0530-2","volume":"141","author":"D Goldfarb","year":"2013","unstructured":"Goldfarb, D., Ma, S., Scheinberg, K.: Fast alternating linearization methods for minimizing the sum of two convex functions. Math. Program. 141(1\u20132), 349\u2013382 (2013)","journal-title":"Math. Program."},{"key":"1555_CR15","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 1.21. Glob. Optim. pp. 155\u2013210 (2008)","DOI":"10.1007\/0-387-30528-9_7"},{"key":"1555_CR16","doi-asserted-by":"crossref","unstructured":"Guo, H., Qiu, C., Vaswani, N.: Practical ReProCS for separating sparse and lowdimensional signal sequences from their sum. Preprint (2013)","DOI":"10.1109\/GlobalSIP.2014.7032141"},{"key":"1555_CR17","unstructured":"He, J., Balzano, L., Szlam, A.: Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video. In: Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, pp. 1568\u20131575. IEEE (2012)"},{"issue":"9","key":"1555_CR18","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., Ye, J., Li, X., He, X.: Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans. Pattern Anal. Mach. Intell. 35(9), 2117\u20132130 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1555_CR19","doi-asserted-by":"crossref","unstructured":"Javed, S., Bouwmans, T., Jung, S.K.: Combining ARF and OR-PCA for robust background subtraction of noisy videos. In: International Conference on Image Analysis and Processing, pp. 340\u2013351. Springer (2015)","DOI":"10.1007\/978-3-319-23234-8_32"},{"issue":"99","key":"1555_CR20","first-page":"1","volume":"pp","author":"S Javed","year":"2016","unstructured":"Javed, S., Mahmood, A., Bouwmans, T., Jung, S.K.: Spatiotemporal low-rank modeling for complex scene background initialization. IEEE Trans. Circuits Syst. Video Technol. pp(99), 1\u20131 (2016)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"issue":"12","key":"1555_CR21","doi-asserted-by":"publisher","first-page":"5840","DOI":"10.1109\/TIP.2017.2746268","volume":"26","author":"S Javed","year":"2017","unstructured":"Javed, S., Mahmood, A., Bouwmans, T., Jung, S.K.: Background-foreground modeling based on spatiotemporal sparse subspace clustering. IEEE Trans. Image Process. 26(12), 5840\u20135854 (2017)","journal-title":"IEEE Trans. Image Process."},{"key":"1555_CR22","doi-asserted-by":"crossref","unstructured":"Kang, Z., Peng, C., Cheng, Q.: Robust PCA via nonconvex rank approximation. In: Data Mining (ICDM), 2015 IEEE International Conference on pp. 211\u2013220. IEEE (2015)","DOI":"10.1109\/ICDM.2015.15"},{"issue":"5","key":"1555_CR23","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1109\/TPAMI.2005.92","volume":"27","author":"KC Lee","year":"2005","unstructured":"Lee, K.C., Ho, J., Kriegman, D.J.: Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans. Pattern Anal. Mach. Intell. 27(5), 684\u2013698 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"1555_CR24","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/TIP.2004.836169","volume":"13","author":"L Li","year":"2004","unstructured":"Li, L., Huang, W., Gu, I.Y.H., Tian, Q.: Statistical modeling of complex backgrounds for foreground object detection. IEEE Trans. Image Process. 13(11), 1459\u20131472 (2004)","journal-title":"IEEE Trans. Image Process."},{"key":"1555_CR25","unstructured":"Lin, Z., Chen, M., Ma, Y.: The Augmented Lagrange Multiplier Method for Exact Recovery Of Corrupted Low-Rank Matrices. arXiv preprint \n                    arXiv:1009.5055\n                    \n                   (2010)"},{"key":"1555_CR26","doi-asserted-by":"crossref","unstructured":"Lin, Z., Ganesh, A., Wright, J., Wu, L., Chen, M., Ma, Y.: Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix. Comput. Adv. Multi Sens. Adapt. Process. (CAMSAP) 61(6) (2009)","DOI":"10.1109\/CAMSAP.2009.5413299"},{"issue":"5","key":"1555_CR27","first-page":"421","volume":"29","author":"Y Liu","year":"2013","unstructured":"Liu, Y., Cao, L., Liu, C., Pu, Y., Cheng, H.: Recovering shape and motion by a dynamic system for low-rank matrix approximation in l1 norm. Vis. Comput. Int. J. Comput. Graph. 29(5), 421\u2013431 (2013)","journal-title":"Vis. Comput. Int. J. Comput. Graph."},{"key":"1555_CR28","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.neunet.2013.06.013","volume":"48","author":"Y Liu","year":"2013","unstructured":"Liu, Y., Jiao, L., Shang, F., Yin, F., Liu, F.: An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion. Neural Netw. 48, 8\u201318 (2013)","journal-title":"Neural Netw."},{"issue":"2","key":"1555_CR29","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.patcog.2013.06.031","volume":"47","author":"X Luan","year":"2014","unstructured":"Luan, X., Fang, B., Liu, L., Yang, W., Qian, J.: Extracting sparse error of robust PCA for face recognition in the presence of varying illumination and occlusion. Pattern Recognit. 47(2), 495\u2013508 (2014)","journal-title":"Pattern Recognit."},{"key":"1555_CR30","doi-asserted-by":"crossref","unstructured":"Mansour, H., Jiang, X.: A robust online subspace estimation and tracking algorithm. In: Acoustics, Speech and Signal Processing (ICASSP), 2015 IEEE International Conference on, pp. 4065\u20134069. IEEE (2015)","DOI":"10.1109\/ICASSP.2015.7178735"},{"issue":"4","key":"1555_CR31","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1109\/76.709404","volume":"8","author":"N Merhav","year":"1998","unstructured":"Merhav, N., Kresch, R.: Approximate convolution using DCT coefficient multipliers. IEEE Trans. Circuits Syst. Video Technol. 8(4), 378\u2013385 (1998)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"1555_CR32","unstructured":"Mu, Y., Dong, J., Yuan, X., Yan, S.: Accelerated low-rank visual recovery by random projection. In: Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on, pp. 2609\u20132616. IEEE (2011)"},{"key":"1555_CR33","doi-asserted-by":"crossref","unstructured":"Oliver, N., Rosario, B., Pentland, A.: A bayesian computer vision system for modeling human interactions. In: International Conference on Computer Vision Systems, pp. 255\u2013272. Springer (1999)","DOI":"10.1007\/3-540-49256-9_16"},{"issue":"1\/2","key":"1555_CR34","first-page":"79","volume":"13","author":"P Porwik","year":"2004","unstructured":"Porwik, P., Lisowska, A.: The Haar-wavelet transform in digital image processing: its status and achievements. Mach. Graph. Vis. 13(1\/2), 79\u201398 (2004)","journal-title":"Mach. Graph. Vis."},{"issue":"8","key":"1555_CR35","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1109\/TSP.2017.2649482","volume":"65","author":"M Rahmani","year":"2017","unstructured":"Rahmani, M., Atia, G.K.: High dimensional low rank plus sparse matrix decomposition. IEEE Trans. Signal Process. 65(8), 2004\u20132019 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1555_CR36","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.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"1","key":"1555_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10851-015-0610-z","volume":"55","author":"P Rodriguez","year":"2016","unstructured":"Rodriguez, P., Wohlberg, B.: Incremental principal component pursuit for video background modeling. J. Math. Imaging Vis. 55(1), 1\u201318 (2016)","journal-title":"J. Math. Imaging Vis."},{"issue":"5","key":"1555_CR38","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1007\/s00138-013-0555-4","volume":"25","author":"F Seidel","year":"2014","unstructured":"Seidel, F., Hage, C., Kleinsteuber, M.: pROST: a smoothed \n                    \n                      \n                    \n                    $$\\ell _p $$\n                    \n                      \n                        \n                          \u2113\n                          p\n                        \n                      \n                    \n                   robust online subspace tracking method for background subtraction in video. Mach. Vis. Appl. 25(5), 1227\u20131240 (2014)","journal-title":"Mach. Vis. Appl."},{"key":"1555_CR39","first-page":"1","volume":"2","author":"G Shan","year":"2017","unstructured":"Shan, G.: Color image denoising via monogenic matrix-based sparse representation. Vis. Comput. 2, 1\u201314 (2017)","journal-title":"Vis. Comput."},{"key":"1555_CR40","unstructured":"Sobral, A., Bouwmans, T., Zahzah, E.H.: LRSLibrary: Low-rank and sparse tools for background modeling and subtraction in videos. In: Robust Low-Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing. CRC Press, Taylor and Francis Group"},{"key":"1555_CR41","doi-asserted-by":"crossref","unstructured":"Sobral, A., Bouwmans, T., ZahZah, E.H.: Double-constrained RPCA based on saliency maps for foreground detection in automated maritime surveillance. In: Advanced Video and Signal Based Surveillance (AVSS), 2015 12th IEEE International Conference on, pp. 1\u20136. IEEE (2015)","DOI":"10.1109\/AVSS.2015.7301753"},{"key":"1555_CR42","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.cviu.2013.12.005","volume":"122","author":"A Sobral","year":"2014","unstructured":"Sobral, A., Vacavant, A.: A comprehensive review of background subtraction algorithms evaluated with synthetic and real videos. Comput. Vis. Image Underst. 122, 4\u201321 (2014)","journal-title":"Comput. Vis. Image Underst."},{"key":"1555_CR43","doi-asserted-by":"crossref","unstructured":"Sun, Q., Xiang, S., Ye, J.: Robust principal component analysis via capped norms. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 311\u2013319. ACM (2013)","DOI":"10.1145\/2487575.2487604"},{"issue":"2","key":"1555_CR44","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Programm. 95(2), 189\u2013217 (2003)","journal-title":"Math. Programm."},{"key":"1555_CR45","doi-asserted-by":"crossref","unstructured":"Vacavant, A., Chateau, T., Wilhelm, A., Lequi\u00e8vre, L.: A benchmark dataset for outdoor foreground\/background extraction. In: Asian Conference on Computer Vision, pp. 291\u2013300. Springer (2012)","DOI":"10.1007\/978-3-642-37410-4_25"},{"key":"1555_CR46","unstructured":"Vaswani, N., Bouwmans, T., Javed, S., Narayanamurthy, P.: Robust PCA and Robust Subspace Tracking. arXiv preprint \n                    arXiv:1711.09492\n                    \n                   (2017)"},{"key":"1555_CR47","unstructured":"Wright, J., Ganesh, A., Rao, S., Peng, Y., Ma, Y.: Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization. In: Advances in Neural Information Processing Systems, pp. 2080\u20132088 (2009)"},{"issue":"6","key":"1555_CR48","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1109\/JPROC.2010.2044470","volume":"98","author":"J Wright","year":"2010","unstructured":"Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T.S., Yan, S.: Sparse representation for computer vision and pattern recognition. Proc. IEEE 98(6), 1031\u20131044 (2010)","journal-title":"Proc. IEEE"},{"issue":"2","key":"1555_CR49","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright, J., Yang, A.Y., Ganesh, A., Sastry, S.S., Ma, Y.: Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 31(2), 210\u2013227 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1555_CR50","doi-asserted-by":"crossref","unstructured":"Xiong, L., Chen, X., Schneider, J.: Direct robust matrix factorizatoin for anomaly detection. In: Data Mining (ICDM), 2011 IEEE 11th International Conference on, pp. 844\u2013853. IEEE (2011)","DOI":"10.1109\/ICDM.2011.52"},{"key":"1555_CR51","doi-asserted-by":"crossref","unstructured":"Xu, J., Ithapu, V.K., Mukherjee, L., Rehg, J.M., Singh, V.: GOSUS: Grassmannian online subspace updates with structured-sparsity. In: Computer Vision (ICCV), 2013 IEEE International Conference on, pp. 3376\u20133383. IEEE (2013)","DOI":"10.1109\/ICCV.2013.419"},{"issue":"11","key":"1555_CR52","doi-asserted-by":"publisher","first-page":"2861","DOI":"10.1109\/TIP.2010.2050625","volume":"19","author":"J Yang","year":"2010","unstructured":"Yang, J., Wright, J., Huang, T.S., Ma, Y.: Image super-resolution via sparse representation. IEEE Trans. Image Process. 19(11), 2861\u20132873 (2010)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"1555_CR53","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for \n                    \n                      \n                    \n                    $$\\ell _1$$\n                    \n                      \n                        \n                          \u2113\n                          1\n                        \n                      \n                    \n                  -minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1(1), 143\u2013168 (2008)","journal-title":"SIAM J. Imaging Sci."},{"key":"1555_CR54","unstructured":"Yuan, X., Yang, J.: Sparse and low-rank matrix decomposition via alternating direction methods. preprint 12 (2009)"},{"issue":"9","key":"1555_CR55","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1162\/NECO_a_00762","volume":"27","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Lin, Z., Zhang, C., Gao, J.: Relations among some low-rank subspace recovery models. Neural Comput. 27(9), 1915\u20131950 (2015)","journal-title":"Neural Comput."},{"key":"1555_CR56","unstructured":"Zhao, Q., Meng, D., Xu, Z., Zuo, W., Zhang, L.: Robust principal component analysis with complex noise. In: International Conference on Machine Learning, pp. 55\u201363 (2014)"},{"key":"1555_CR57","unstructured":"Zhou, T., Tao, D.: Godec: Randomized low-rank and sparse matrix decomposition in noisy case. In: International Conference on Machine Learning. Omnipress (2011)"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-018-1555-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-018-1555-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-018-1555-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T02:53:05Z","timestamp":1571107985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-018-1555-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,24]]},"references-count":57,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["1555"],"URL":"https:\/\/doi.org\/10.1007\/s00371-018-1555-1","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"type":"print","value":"0178-2789"},{"type":"electronic","value":"1432-2315"}],"subject":[],"published":{"date-parts":[[2018,5,24]]},"assertion":[{"value":"24 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}