{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T02:40:08Z","timestamp":1751769608361,"version":"3.41.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319973036"},{"type":"electronic","value":"9783319973043"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-97304-3_43","type":"book-chapter","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T18:34:06Z","timestamp":1532630046000},"page":"559-573","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Low-Rank Matrix Recovery via Continuation-Based Approximate Low-Rank Minimization"],"prefix":"10.1007","author":[{"given":"Xiang","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yongqiang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Long","family":"Lan","sequence":"additional","affiliation":[]},{"given":"Xiaowei","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Xuhui","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zhigang","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,27]]},"reference":[{"issue":"1","key":"43_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":"3","key":"43_CR2","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 58(3), 11 (2011)","journal-title":"J. ACM"},{"issue":"6","key":"43_CR3","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":"43_CR4","doi-asserted-by":"crossref","unstructured":"Cao, Z., Long, M., Wang, J., Yu, P.S.: HashNet: deep learning to hash by continuation. In: IEEE International Conference on Computer Vision, pp. 5609\u20135618 (2017)","DOI":"10.1109\/ICCV.2017.598"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Chen, C.F., Wei, C.P., Wang, Y.C.F.: Low-rank matrix recovery with structural incoherence for robust face recognition. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2618\u20132625 (2012)","DOI":"10.1109\/CVPR.2012.6247981"},{"issue":"23","key":"43_CR6","doi-asserted-by":"publisher","first-page":"6276","DOI":"10.1109\/TSP.2014.2362880","volume":"62","author":"Q Fan","year":"2014","unstructured":"Fan, Q., Jiao, Y., Lu, X.: A primal dual active set algorithm with continuation for compressed sensing. IEEE Trans. Sig. Process. 62(23), 6276\u20136285 (2014)","journal-title":"IEEE Trans. Sig. Process."},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Gao, Y., Cai, H., Zhang, X., Lan, L., Luo, Z.: Background subtraction via 3D convolutional neural networks. In: International Conference on Pattern Recognition. IEEE (2018)","DOI":"10.1109\/ICPR.2018.8545320"},{"issue":"1","key":"43_CR8","first-page":"2979","volume":"14","author":"P Gong","year":"2013","unstructured":"Gong, P., Ye, J., Zhang, C.: Multi-stage multi-task feature learning. J. Mach. Learn. Res. 14(1), 2979\u20133010 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"43_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s11263-016-0930-5","volume":"121","author":"S Gu","year":"2017","unstructured":"Gu, S., Xie, Q., Meng, D., Zuo, W., Feng, X., Zhang, L.: Weighted nuclear norm minimization and its applications to low level vision. Int. J. Comput. Vis. 121(2), 183\u2013208 (2017)","journal-title":"Int. J. Comput. Vis."},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Guo, X., Lin, Z., Center, C.M.I.: Route: robust outlier estimation for low rank matrix recovery. In: International Joint Conference on Artificial Intelligence, pp. 1746\u20131752 (2017)","DOI":"10.24963\/ijcai.2017\/242"},{"issue":"9","key":"43_CR11","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."},{"issue":"2","key":"43_CR12","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10915-015-0045-0","volume":"66","author":"ZF Jin","year":"2016","unstructured":"Jin, Z.F., Wan, Z., Jiao, Y., Lu, X.: An alternating direction method with continuation for nonconvex low rank minimization. J. Sci. Comput. 66(2), 849\u2013869 (2016)","journal-title":"J. Sci. Comput."},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Kang, Z., Peng, C., Cheng, Q.: Robust PCA via nonconvex rank approximation. In: IEEE International Conference on Data Mining, pp. 211\u2013220 (2015)","DOI":"10.1109\/ICDM.2015.15"},{"issue":"11","key":"43_CR14","doi-asserted-by":"publisher","first-page":"2088","DOI":"10.1109\/LSP.2015.2460737","volume":"22","author":"Z Kang","year":"2015","unstructured":"Kang, Z., Peng, C., Cheng, Q.: Robust subspace clustering via smoothed rank approximation. IEEE Sig. Process. Lett. 22(11), 2088\u20132092 (2015)","journal-title":"IEEE Sig. Process. Lett."},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Kang, Z., Peng, C., Cheng, Q.: Robust subspace clustering via tighter rank approximation. In: ACM International on Conference on Information and Knowledge Management, pp. 393\u2013401 (2015)","DOI":"10.1145\/2806416.2806506"},{"issue":"7553","key":"43_CR16","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436 (2015)","journal-title":"Nature"},{"issue":"3","key":"43_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11228-004-7197-7","volume":"13","author":"AS Lewis","year":"2005","unstructured":"Lewis, A.S., Sendov, H.S.: Nonsmooth analysis of singular values. Part i: theory. Set-Valued Anal. 13(3), 213\u2013241 (2005)","journal-title":"Set-Valued Anal."},{"issue":"11","key":"43_CR18","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."},{"issue":"3","key":"43_CR19","first-page":"707","volume":"56","author":"Z Lin","year":"2009","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. J. Marine Biol. Assoc. UK 56(3), 707\u2013722 (2009)","journal-title":"J. Marine Biol. Assoc. UK"},{"key":"43_CR20","unstructured":"Lin, Z., Liu, R., Su, Z.: Linearized alternating direction method with adaptive penalty for low-rank representation. In: Advances in Neural Information Processing Systems, pp. 612\u2013620 (2011)"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Lu, C., Tang, J., Yan, S., Lin, Z.: Generalized nonconvex nonsmooth low-rank minimization. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 4130\u20134137 (2014)","DOI":"10.1109\/CVPR.2014.526"},{"issue":"1","key":"43_CR22","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res. 11(1), 19\u201360 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"43_CR23","doi-asserted-by":"crossref","unstructured":"Mu, Y., Dong, J., Yuan, X., Yan, S.: Accelerated low-rank visual recovery by random projection. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2609\u20132616 (2011)","DOI":"10.1109\/CVPR.2011.5995369"},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Peng, C., Kang, Z., Li, H., Cheng, Q.: Subspace clustering using log-determinant rank approximation. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 925\u2013934 (2015)","DOI":"10.1145\/2783258.2783303"},{"key":"43_CR25","doi-asserted-by":"crossref","unstructured":"Peng, C., Kang, Z., Yang, M., Cheng, Q.: RAP: scalable RPCA for low-rank matrix recovery. In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, pp. 2113\u20132118 (2016)","DOI":"10.1145\/2983323.2983651"},{"issue":"3","key":"43_CR26","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."},{"key":"43_CR27","doi-asserted-by":"crossref","unstructured":"Shen, X., Wu, Y.: A unified approach to salient object detection via low rank matrix recovery. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 853\u2013860 (2012)","DOI":"10.1109\/CVPR.2012.6247758"},{"key":"43_CR28","doi-asserted-by":"crossref","unstructured":"Toyama, K., Krumm, J., Brumitt, B., Meyers, B.: Wallflower: principles and practice of background maintenance. In: IEEE International Conference on Computer Vision, pp. 255\u2013261 (1999)","DOI":"10.1109\/ICCV.1999.791228"},{"key":"43_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-33786-4_10","volume-title":"Computer Vision \u2013 ECCV 2012","author":"N Wang","year":"2012","unstructured":"Wang, N., Yao, T., Wang, J., Yeung, D.-Y.: A probabilistic approach to robust matrix factorization. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7578, pp. 126\u2013139. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33786-4_10"},{"key":"43_CR30","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)"},{"key":"43_CR31","unstructured":"Xiang, S., Tong, X., Ye, J.: Efficient sparse group feature selection via nonconvex optimization. In: International Conference on Machine Learning, pp. 284\u2013292 (2013)"},{"key":"43_CR32","doi-asserted-by":"crossref","unstructured":"Xin, B., Tian, Y., Wang, Y., Gao, W.: Background subtraction via generalized fused lasso foreground modeling. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 4676\u20134684 (2015)","DOI":"10.1109\/CVPR.2015.7299099"},{"key":"43_CR33","unstructured":"Yuan, X., Yang, J.: Sparse and low rank matrix decomposition via alternating direction method. Pac. J. Optim. 9(1) (2009)"},{"issue":"2","key":"43_CR34","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H., et al.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"3","key":"43_CR35","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11(3), 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"43_CR36","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.neunet.2014.01.001","volume":"53","author":"Z Zhang","year":"2014","unstructured":"Zhang, Z., Yan, S., Zhao, M.: Similarity preserving low-rank representation for enhanced data representation and effective subspace learning. Neural Netw. 53, 81\u201394 (2014)","journal-title":"Neural Netw."},{"key":"43_CR37","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.neunet.2017.08.001","volume":"96","author":"Z Zhang","year":"2017","unstructured":"Zhang, Z., Zhao, M., Li, F., Zhang, L., Yan, S.: Robust alternating low-rank representation by joint lp-and l2, p-norm minimization. Neural Netw. 96, 55\u201370 (2017)","journal-title":"Neural Netw."},{"key":"43_CR38","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Liu, G., Sugimoto, S., Yan, S., Okutomi, M.: Practical low-rank matrix approximation under robust $$\\ell_1$$\u21131-norm. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1410\u20131417 (2012)","DOI":"10.1109\/CVPR.2012.6247828"},{"key":"43_CR39","doi-asserted-by":"crossref","unstructured":"Zou, W., Kpalma, K., Liu, Z., Ronsin, J.: Segmentation driven low-rank matrix recovery for saliency detection. In: British Machine Vision Conference, pp. 1\u201313 (2013)","DOI":"10.5244\/C.27.78"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2018: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97304-3_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T02:00:06Z","timestamp":1751767206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-97304-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319973036","9783319973043"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97304-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}