{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:55:42Z","timestamp":1760597742218,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T00:00:00Z","timestamp":1491436800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of China (CN)","award":["11241005"],"award-info":[{"award-number":["11241005"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SIViP"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11760-017-1084-9","type":"journal-article","created":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T12:32:29Z","timestamp":1491481949000},"page":"1271-1278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Augmented Lagrangian alternating direction method for low-rank minimization via non-convex approximation"],"prefix":"10.1007","volume":"11","author":[{"given":"Yongyong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8221-451X","authenticated-orcid":false,"given":"Yongli","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoping","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,6]]},"reference":[{"issue":"3","key":"1084_CR1","doi-asserted-by":"crossref","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., et al.: Robust principal component analysis? J. ACM 58(3), 11 (2011)","journal-title":"J. ACM"},{"key":"1084_CR2","unstructured":"Wright, J., Ganesh, A., Rao, S., et al.: Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization. In: 23rd Annual Conference on Advances in Neural Information Processing Systems 22, Vancouver, 7\u201310 Dec 2009 (2009)"},{"key":"1084_CR3","first-page":"362","volume":"1","author":"F Torre De la","year":"2001","unstructured":"De la Torre, F., Black, M.J.: Robust principal component analysis for computer vision. ICCV 1, 362\u2013369 (2001)","journal-title":"ICCV"},{"key":"1084_CR4","unstructured":"Xu, H., Caramanis, C., Sanghavi, S.: Robust PCA via outlier pursuit. In: Proceedings of the 23rd International Conference on Neural Information Processing Systems, NIPS\u201910, pp. 2496\u20132504, Curran Associates Inc, Vancouver, 6\u20139 Dec 2010 (2010)"},{"issue":"1","key":"1084_CR5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","volume":"35","author":"G Liu","year":"2013","unstructured":"Liu, G., Lin, Z., Yan, S., et al.: Robust recovery of subspace structures by low-rank representation. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 171\u2013184 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"1084_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11263-012-0515-x","volume":"99","author":"Z Zhang","year":"2010","unstructured":"Zhang, Z., Liang, X., Ganesh, A., et al.: TILT: transform invariant low-rank textures. Int. J. Comput. Vis. 99(1), 1\u201324 (2010)","journal-title":"Int. J. Comput. Vis."},{"issue":"1","key":"1084_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1093\/imanum\/drq039","volume":"32","author":"C Chen","year":"2012","unstructured":"Chen, C., He, B., Yuan, X.: Matrix completion via an alternating direction method. IMA J. Numer. Anal. 32(1), 227\u2013245 (2012)","journal-title":"IMA J. Numer. Anal."},{"issue":"6","key":"1084_CR8","doi-asserted-by":"crossref","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\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"1084_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.patrec.2013.08.006","volume":"43","author":"R Vidal","year":"2014","unstructured":"Vidal, R., Favaro, P.: Low rank subspace clustering (LRSC). Pattern Recognit. Lett. 43, 47\u201361 (2014)","journal-title":"Pattern Recognit. Lett."},{"issue":"2","key":"1084_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/2674559","volume":"47","author":"X Zhou","year":"2015","unstructured":"Zhou, X., Yang, C., Zhao, H., et al.: Low rank modeling and its applications in image analysis. ACM Comput. Surv. 47(2), 36 (2015)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"1084_CR11","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s11464-012-0194-5","volume":"7","author":"Y Xu","year":"2012","unstructured":"Xu, Y., Yin, W., Wen, Z., et al.: An alternating direction algorithm for matrix completion with nonnegative factors. Front. Math. China 7(2), 365\u2013384 (2012)","journal-title":"Front. Math. China"},{"issue":"3","key":"1084_CR12","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1002\/mrm.25240","volume":"73","author":"R Otazo","year":"2015","unstructured":"Otazo, R., Cand\u00e8s, E.J., Sodickson, K.: Low-rank plus sparse matrix decomposition for accelerated dynamic MRI with separation of background and dynamic components. Magn. Reson. Med. 73(3), 1125\u20131136 (2015)","journal-title":"Magn. Reson. Med."},{"issue":"8","key":"1084_CR13","doi-asserted-by":"crossref","first-page":"5186","DOI":"10.1109\/TIT.2013.2257913","volume":"59","author":"M Mardani","year":"2013","unstructured":"Mardani, M., Mateos, G., Giannakis, G.: Recovery of low-rank plus compressed sparse matrices with application to unveiling traffic anomalies. IEEE Trans. Inf. Theory 59(8), 5186\u20135205 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1084_CR14","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 (2013)","DOI":"10.1145\/2487575.2487604"},{"issue":"9","key":"1084_CR15","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2013","unstructured":"Hu, Y., Zhang, D., Ye, J., et al.: 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."},{"issue":"11","key":"1084_CR16","doi-asserted-by":"crossref","first-page":"5714","DOI":"10.1109\/TSP.2012.2212015","volume":"60","author":"G Marjanovic","year":"2012","unstructured":"Marjanovic, G., Solo, V.: On optimization and matrix completion. IEEE Trans. Signal Process. 60(11), 5714\u20135724 (2012)","journal-title":"IEEE Trans. Signal Process."},{"key":"1084_CR17","doi-asserted-by":"crossref","unstructured":"Peng, C., Kang, Z., Li, H., et al.: Subspace clustering using log-determinant rank approximation. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 925\u2013934 (2015)","DOI":"10.1145\/2783258.2783303"},{"issue":"1","key":"1084_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1515\/jip-2012-0030","volume":"21","author":"Y Wang","year":"2013","unstructured":"Wang, Y., Liu, P., Li, Z., et al.: Data regularization using Gaussian beams decomposition and sparse norms. J. Inverse Ill Posed Probl. 21(1), 1\u201323 (2013)","journal-title":"J. Inverse Ill Posed Probl."},{"issue":"1","key":"1084_CR19","first-page":"289","volume":"22","author":"P Tao","year":"1997","unstructured":"Tao, P., An, L.: Convex analysis approach to dc programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"1084_CR20","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic press, Cambridge (1982)"},{"issue":"1","key":"1084_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., et al.: 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."},{"key":"1084_CR22","unstructured":"Lin, Z., Chen, M., Ma, Y.: The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv preprint arXiv:1009.5055 (2010)"},{"key":"1084_CR23","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M Bazaraa","year":"1993","unstructured":"Bazaraa, M., Sherali, H., Shetty, C.: Nonlinear Programming: Theory and Algorithms. Wiley, Hoboken (1993)"},{"issue":"3","key":"1084_CR24","first-page":"11","volume":"8","author":"J Huang","year":"2014","unstructured":"Huang, J., Nie, F., Huang, H., et al.: Robust manifold nonnegative matrix factorization. ACM Trans. Knowl. Discov. Data (TKDD) 8(3), 11 (2014)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"1","key":"1084_CR25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"4","key":"1084_CR26","doi-asserted-by":"crossref","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":"1","key":"1084_CR27","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao, M., Yuan, X.: Recovering low-rank and sparse components of matrices from incomplete and noisy observation. SIAM J. Optim. 21(1), 57\u201381 (2011)","journal-title":"SIAM J. Optim."},{"key":"1084_CR28","unstructured":"Zhou, T., Tao, D.: Godec: Randomized low-rank and sparse matrix decomposition in noisy case. In: 28th International Conference on Machine Learning (ICML), pp. 33\u201340, Bellevue, 28 June\u20132 July 2011 (2011)"},{"key":"1084_CR29","unstructured":"Netrapalli, P., Niranjan, U.N., Sanghavi, S., et al.: Non-convex robust PCA. In: Ghahraman, Z., Welling, M., Cortes, C., Lawrence, N.D., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 27, pp. 1107\u20131115. Curran Associates, Inc. (2014)"},{"issue":"11","key":"1084_CR30","doi-asserted-by":"crossref","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35(11), 2765\u20132781 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1084_CR31","volume-title":"A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate. ECCV 2006","author":"J Yan","year":"2006","unstructured":"Yan, J., Pollefeys, M.: A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate. ECCV 2006. Springer, Berlin (2006)"},{"issue":"3","key":"1084_CR32","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s11263-008-0178-9","volume":"81","author":"G Chen","year":"2009","unstructured":"Chen, G., Lerman, G.: Spectral curvature clustering (SCC). Int. J. Comput. Vis. 81(3), 317\u2013330 (2009)","journal-title":"Int. J. Comput. Vis."},{"issue":"11","key":"1084_CR33","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1109\/TIP.2004.836169","volume":"13","author":"L Li","year":"2004","unstructured":"Li, L., Huang, W., Gu, I., et al.: Statistical modeling of complex backgrounds for foreground object detection. IEEE Trans. Image Process. 13(11), 1459\u20131472 (2004)","journal-title":"IEEE Trans. Image Process."},{"issue":"1\u20132","key":"1084_CR34","doi-asserted-by":"crossref","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."},{"issue":"11","key":"1084_CR35","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1109\/TPAMI.2011.282","volume":"34","author":"Y Peng","year":"2012","unstructured":"Peng, Y., Ganesh, A., Wright, J., et al.: RASL: robust alignment by sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell. 34(11), 2233\u20132246 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"1084_CR36","doi-asserted-by":"crossref","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."},{"key":"1084_CR37","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Mustafa, N.H.: k-Means projective clustering. In: Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 155\u2013165 (2004)","DOI":"10.1145\/1055558.1055581"}],"container-title":["Signal, Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11760-017-1084-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-017-1084-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-017-1084-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T03:00:38Z","timestamp":1601866838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11760-017-1084-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,6]]},"references-count":37,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1084"],"URL":"https:\/\/doi.org\/10.1007\/s11760-017-1084-9","relation":{},"ISSN":["1863-1703","1863-1711"],"issn-type":[{"type":"print","value":"1863-1703"},{"type":"electronic","value":"1863-1711"}],"subject":[],"published":{"date-parts":[[2017,4,6]]}}}