{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:36:03Z","timestamp":1767339363310,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2019,11,30]],"date-time":"2019-11-30T00:00:00Z","timestamp":1575072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,30]],"date-time":"2019-11-30T00:00:00Z","timestamp":1575072000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s11042-019-08430-2","type":"journal-article","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T14:42:31Z","timestamp":1576507351000},"page":"2703-2717","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust matrix completion with complex noise"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3937-1007","authenticated-orcid":false,"given":"Li","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,30]]},"reference":[{"key":"8430_CR1","doi-asserted-by":"crossref","unstructured":"Agudo A, Pijoan M, Moreno-Noguer F (2018) Image collection pop-up: 3d reconstruction and clustering of rigid and non-rigid categories. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2607\u20132615","DOI":"10.1109\/CVPR.2018.00276"},{"issue":"3","key":"8430_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11263-006-8815-7","volume":"72","author":"R Basri","year":"2007","unstructured":"Basri R, Jacobs D, Kemelmacher I (2007) Photometric stereo with general, unknown lighting. Int J Comput Vis 72(3):239\u2013257","journal-title":"Int J Comput Vis"},{"issue":"4","key":"8430_CR3","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai J-F, Cand\u00e8s EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956\u20131982","journal-title":"SIAM J Optim"},{"issue":"5","key":"8430_CR4","doi-asserted-by":"publisher","first-page":"S440","DOI":"10.1137\/15M1025153","volume":"38","author":"L Cambier","year":"2016","unstructured":"Cambier L, Absil P-A (2016) Robust low-rank matrix completion by riemannian optimization. SIAM J Sci Comput 38(5):S440\u2013S460","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"8430_CR5","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":"8430_CR6","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"},{"issue":"2","key":"8430_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s11263-013-0684-2","volume":"107","author":"Y Dai","year":"2014","unstructured":"Dai Y, Li H, He M (2014) A simple prior-free method for non-rigid structure-from-motion factorization. Int J Comput Vis 107(2):101\u2013122","journal-title":"Int J Comput Vis"},{"key":"8430_CR8","unstructured":"Elsener A, Van De Geer S (2016) Robust low-rank matrix estimation"},{"key":"8430_CR9","doi-asserted-by":"crossref","unstructured":"Eriksson A, Van Den Hengel A (2010) Efficient computation of robust low-rank matrix approximations in the presence of missing data using the l1 norm","DOI":"10.1109\/CVPR.2010.5540139"},{"issue":"2","key":"8430_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1011419012209","volume":"4","author":"K Goldberg","year":"2001","unstructured":"Goldberg K, Roeder T, Gupta D, Perkins C (2001) Eigentaste: a constant time collaborative filtering algorithm. Information Retrieval 4(2):133\u2013151","journal-title":"Information Retrieval"},{"issue":"2","key":"8430_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s11263-016-0930-5","volume":"121","author":"S Gu","year":"2017","unstructured":"Gu S, et al. (2017) Weighted nuclear norm minimization and its applications to low level vision. Int J Comput Vis 121(2):183\u2013208","journal-title":"Int J Comput Vis"},{"key":"8430_CR12","unstructured":"He J, Balzano L, Szlam A (2012) Incremental gradient on the grassmannian for online foreground and background separation in subsampled video. In: 2012 IEEE conference on computer vision and pattern recognition (CVPR). IEEE, pp 1568\u20131575"},{"key":"8430_CR13","doi-asserted-by":"crossref","unstructured":"Herlocker JL, Konstan JA, Borchers A, Riedl J (2017) An algorithmic framework for performing collaborative filtering. In: ACM SIGIR forum, vol 51. ACM, pp 227\u2013234","DOI":"10.1145\/3130348.3130372"},{"issue":"9","key":"8430_CR14","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 (2013) Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans Pattern Anal Mach Intell 35(9):2117\u20132130","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"8430_CR15","doi-asserted-by":"crossref","unstructured":"Hu Z, Nie F, Wang R, Li X (2019) Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding. Inf Fusion","DOI":"10.1016\/j.inffus.2019.09.005"},{"key":"8430_CR16","doi-asserted-by":"crossref","unstructured":"Huber PJ (2011) Robust statistics. In: International encyclopedia of statistical science. Springer, pp 1248\u20131251","DOI":"10.1007\/978-3-642-04898-2_594"},{"key":"8430_CR17","doi-asserted-by":"crossref","unstructured":"Jegou H, Douze M, Schmid C (2008) Hamming embedding and weak geometric consistency for large scale image search. In: European conference on computer vision. Springer, pp 304\u2013317","DOI":"10.1007\/978-3-540-88682-2_24"},{"key":"8430_CR18","unstructured":"Ke Q, Kanade T (2005) Robust \u21131 norm factorization in the presence of outliers and missing data by alternative convex programming. In: IEEE computer society conference on computer vision and pattern recognition, 2005. CVPR 2005, vol 1. IEEE, pp 739\u2013746"},{"issue":"1","key":"8430_CR19","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TPAMI.2017.2651816","volume":"40","author":"Z Lin","year":"2018","unstructured":"Lin Z, Xu C, Zha H (2018) Robust matrix factorization by majorization minimization. IEEE Trans Pattern Anal Mach Intell 40(1):208\u2013220","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"8430_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","volume":"35","author":"G Liu","year":"2013","unstructured":"Liu G, et al. (2013) Robust recovery of subspace structures by low-rank representation. IEEE Trans Pattern Anal Mach Intell 35(1):171\u2013184","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"8430_CR21","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1109\/TNNLS.2018.2851957","volume":"30","author":"Q Liu","year":"2019","unstructured":"Liu Q, Davoine F, Yang J, Cui Y, Jin Z, Han F (2019) A fast and accurate matrix completion method based on QR decomposition and \u21132,1 -norm minimization. IEEE Trans Neural Netw Learning Syst 30(3):803\u2013817","journal-title":"IEEE Trans Neural Netw Learning Syst"},{"key":"8430_CR22","doi-asserted-by":"crossref","unstructured":"Lu C, Tang J, Yan S, Lin Z (2014) Generalized nonconvex nonsmooth low-rank minimization. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 4130\u20134137","DOI":"10.1109\/CVPR.2014.526"},{"key":"8430_CR23","doi-asserted-by":"crossref","unstructured":"Lu C, Zhu C, et al. (2015) Generalized singular value thresholding. In: AAAI, pp 1805\u20131811","DOI":"10.1609\/aaai.v29i1.9464"},{"key":"8430_CR24","doi-asserted-by":"crossref","unstructured":"Meng D, Xu Z, Zhang L, Ji Z (2013) A cyclic weighted median method for l1 low-rank matrix factorization with missing entries. In: AAAI, vol 4, p 6","DOI":"10.1609\/aaai.v27i1.8562"},{"key":"8430_CR25","unstructured":"Ngo T, Saad Y (2012) Scaled gradients on grassmann manifolds for matrix completion. In: Advances in neural information processing systems, pp 1412\u20131420"},{"key":"8430_CR26","doi-asserted-by":"crossref","unstructured":"Nie F, Hu Z, Li X (2018) Calibrated multi-task learning. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining . ACM, pp 2012\u20132021","DOI":"10.1145\/3219819.3219951"},{"issue":"5","key":"8430_CR27","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1109\/TIP.2018.2886712","volume":"28","author":"F Nie","year":"2019","unstructured":"Nie F, Hu Z, Li X (2019) Matrix completion based on non-convex low-rank approximation. IEEE Trans Image Process 28(5):2378\u20132388","journal-title":"IEEE Trans Image Process"},{"key":"8430_CR28","unstructured":"Nie F, Huang H, Ding CHQ (2012) Low-rank matrix recovery via efficient schatten p-norm minimization. In: AAAI"},{"key":"8430_CR29","doi-asserted-by":"crossref","unstructured":"Philbin J, Chum O, Isard M, Sivic J, Zisserman A (2007) Object retrieval with large vocabularies and fast spatial matching. In: IEEE conference on computer vision and pattern recognition, 2007. CVPR\u201907. IEEE, p 2007","DOI":"10.1109\/CVPR.2007.383172"},{"issue":"4","key":"8430_CR30","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1214\/18-AOS1742","volume":"47","author":"A Pierre","year":"2019","unstructured":"Pierre A, Vincent C, Guillaume L (2019) Estimation bounds and sharp oracle inequalities of regularized procedures with lipschitz loss functions. The Annals of Statistics 47(4):2117\u20132144","journal-title":"The Annals of Statistics"},{"key":"8430_CR31","unstructured":"Kwok J, Yao QM (2018) Scalable robust matrix factorization with nonconvex loss. In: Proceedings of the advances in neural information processing systems, pp 369\u2013404"},{"key":"8430_CR32","unstructured":"Shang F, et al. (2017) Bilinear factor matrix norm minimization for robust pca: algorithms and applications. IEEE Trans Pattern Anal Mach Intell (1):1\u20131"},{"issue":"4","key":"8430_CR33","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1109\/TFUZZ.2017.2760287","volume":"26","author":"F Shang","year":"2018","unstructured":"Shang F, Liu Y, Cheng J, Yan D (2018) Fuzzy double trace norm minimization for recommendation systems. IEEE Trans Fuzzy Systems 26(4):2039\u20132049","journal-title":"IEEE Trans Fuzzy Systems"},{"key":"8430_CR34","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ins.2015.02.026","volume":"307","author":"F Shang","year":"2015","unstructured":"Shang F, Liu Y, Tong H, Cheng J, Cheng H (2015) Robust bilinear factorization with missing and grossly corrupted observations. Inf Sci 307:53\u201372","journal-title":"Inf Sci"},{"key":"8430_CR35","doi-asserted-by":"crossref","unstructured":"Sun Q, Xiang S, Ye J (2013) Robust principal component analysis via capped norms. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 311\u2013319","DOI":"10.1145\/2487575.2487604"},{"issue":"2","key":"8430_CR36","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.acha.2015.08.003","volume":"40","author":"J Tanner","year":"2016","unstructured":"Tanner J, Ke W (2016) Low rank matrix completion by alternating steepest descent methods. Appl Comput Harmon Anal 40(2):417\u2013429","journal-title":"Appl Comput Harmon Anal"},{"issue":"2","key":"8430_CR37","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF00129684","volume":"9","author":"C Tomasi","year":"1992","unstructured":"Tomasi C, Kanade T (1992) Shape and motion from image streams under orthography: a factorization method. Int J Comput Vis 9(2):137\u2013154","journal-title":"Int J Comput Vis"},{"issue":"2","key":"8430_CR38","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1137\/110845768","volume":"23","author":"B Vandereycken","year":"2013","unstructured":"Vandereycken B (2013) Low-rank matrix completion by riemannian optimization. SIAM J Optim 23(2):1214\u20131236","journal-title":"SIAM J Optim"},{"issue":"10","key":"8430_CR39","doi-asserted-by":"publisher","first-page":"4833","DOI":"10.1109\/TNNLS.2017.2777489","volume":"29","author":"Y Wang","year":"2018","unstructured":"Wang Y, Wu L, Lin X, Gao J (2018) Multiview spectral clustering via structured low-rank matrix factorization. IEEE Trans Neural Netw Learning Syst 29 (10):4833\u20134843","journal-title":"IEEE Trans Neural Netw Learning Syst"},{"issue":"4","key":"8430_CR40","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen Z, Yin W, Zhang Y (2012) Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math Program Comput 4(4):333\u2013361","journal-title":"Math Program Comput"},{"key":"8430_CR41","unstructured":"Yao Q (2018) Scalable tensor completion with nonconvex regularization. arXiv:1807.08725"},{"key":"8430_CR42","unstructured":"Yao Q, Kwok JT, Wang T, Liu T-Y (2017) Large-scale low-rank matrix learning with nonconvex regularizers. arXiv:1708.00146"},{"issue":"18","key":"8430_CR43","doi-asserted-by":"publisher","first-page":"4767","DOI":"10.1109\/TSP.2016.2572049","volume":"64","author":"L Zhao","year":"2016","unstructured":"Zhao L, Babu P, Palomar DP (2016) Efficient algorithms on robust low-rank matrix completion against outliers. IEEE Trans Signal Processing 64(18):4767\u20134780","journal-title":"IEEE Trans Signal Processing"},{"key":"8430_CR44","unstructured":"Zheng Y, Liu G, Sugimoto S, Yan S, Okutomi M (2012) Practical low-rank matrix approximation under robust l 1-norm. In: 2012 IEEE conference on computer vision and pattern recognition (CVPR). IEEE, p 2012"},{"issue":"11","key":"8430_CR45","doi-asserted-by":"publisher","first-page":"5264","DOI":"10.1109\/TNNLS.2018.2797248","volume":"29","author":"L Zhu","year":"2018","unstructured":"Zhu L, Zi H, Li Z, Xie L, Shen HT (2018) Exploring auxiliary context: discrete semantic transfer hashing for scalable image retrieval. IEEE Trans Neural Netw Learning Syst 29(11):5264\u20135276","journal-title":"IEEE Trans Neural Netw Learning Syst"},{"issue":"9","key":"8430_CR46","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1109\/TMM.2017.2729025","volume":"19","author":"L Zhu","year":"2017","unstructured":"Zhu L, Zi H, Liu X, He X, Sun J, Zhou X (2017) Discrete multimodal hashing with canonical views for robust mobile landmark search. IEEE Trans Multimedia 19(9):2066\u20132079","journal-title":"IEEE Trans Multimedia"},{"issue":"2","key":"8430_CR47","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1109\/TKDE.2016.2562624","volume":"29","author":"L Zhu","year":"2017","unstructured":"Zhu L, Shen J, Xie L, Cheng Z (2017) Unsupervised visual hashing with semantic assistant for content-based image retrieval. IEEE Trans Knowl Data Eng 29 (2):472\u2013486","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-019-08430-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-019-08430-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-019-08430-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T16:00:43Z","timestamp":1665244843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-019-08430-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,30]]},"references-count":47,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["8430"],"URL":"https:\/\/doi.org\/10.1007\/s11042-019-08430-2","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2019,11,30]]},"assertion":[{"value":"13 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}