{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T03:49:25Z","timestamp":1775620165375,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,3,13]],"date-time":"2022-03-13T00:00:00Z","timestamp":1647129600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,13]],"date-time":"2022-03-13T00:00:00Z","timestamp":1647129600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100013093","name":"science and technology planning project of shenzhen municipality","doi-asserted-by":"publisher","award":["0000000170403591"],"award-info":[{"award-number":["0000000170403591"]}],"id":[{"id":"10.13039\/501100013093","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62171287"],"award-info":[{"award-number":["62171287"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11227-022-04385-8","type":"journal-article","created":{"date-parts":[[2022,3,13]],"date-time":"2022-03-13T08:02:41Z","timestamp":1647158561000},"page":"12950-12972","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A robust low-rank matrix completion based on truncated nuclear norm and Lp-norm"],"prefix":"10.1007","volume":"78","author":[{"given":"Hao","family":"Liang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4094-3348","authenticated-orcid":false,"given":"Li","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Jianjun","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,13]]},"reference":[{"issue":"5","key":"4385_CR1","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1109\/TPAMI.2015.2469276","volume":"38","author":"X Li","year":"2015","unstructured":"Li X, Shen C, Dick A et al (2015) Online metric-weighted linear representations for robust visual tracking. IEEE Transac Pattern Anal Mach Intell 38(5):931\u2013950. https:\/\/doi.org\/10.1109\/TPAMI.2015.2469276","journal-title":"IEEE Transac Pattern Anal Mach Intell"},{"issue":"12","key":"4385_CR2","doi-asserted-by":"publisher","first-page":"1768","DOI":"10.1109\/LSP.2019.2929869","volume":"26","author":"E Tsiligianni","year":"2019","unstructured":"Tsiligianni E, Deligiannis N (2019) Deep coupled-representation learning for sparse linear inverse problems with side information. IEEE Signal Process Lett 26(12):1768\u20131772. https:\/\/doi.org\/10.1109\/LSP.2019.2929869","journal-title":"IEEE Signal Process Lett"},{"issue":"1","key":"4385_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/s11227-010-0533-9","volume":"58","author":"H Tang","year":"2011","unstructured":"Tang H, Sun Y, Yin B et al (2011) 3D face recognition based on sparse representation. J Supercomput 58(1):84\u201395. https:\/\/doi.org\/10.1007\/s11227-010-0533-9","journal-title":"J Supercomput"},{"key":"4385_CR4","doi-asserted-by":"publisher","first-page":"108377","DOI":"10.1016\/j.sigpro.2021.108377","volume":"192","author":"X Ding","year":"2022","unstructured":"Ding X, Liang H, Jakobsson A et al (2022) High-resolution source localization exploiting the sparsity of the beamforming map. Signal Process 192:108377. https:\/\/doi.org\/10.1016\/j.sigpro.2021.108377","journal-title":"Signal Process"},{"key":"4385_CR5","doi-asserted-by":"publisher","unstructured":"Xu JL, Hsu YL (2022) Analysis of agricultural exports based on deep learning and text mining. J Supercompu 1\u201317. https:\/\/doi.org\/10.1007\/s11227-021-04238-w","DOI":"10.1007\/s11227-021-04238-w"},{"issue":"2","key":"4385_CR6","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/TIP.2018.2874284","volume":"28","author":"M Zhang","year":"2018","unstructured":"Zhang M, Desrosiers C (2018) High-quality image restoration using low-rank patch regularization and global structure sparsity. IEEE Transact Image Process 28(2):868\u2013879. https:\/\/doi.org\/10.1109\/TIP.2018.2874284","journal-title":"IEEE Transact Image Process"},{"issue":"6","key":"4385_CR7","doi-asserted-by":"publisher","first-page":"2473","DOI":"10.1109\/JSTARS.2015.2423278","volume":"8","author":"S Jia","year":"2015","unstructured":"Jia S, Zhang X, Li Q (2015) Spectral-spatial hyperspectral image classification using $$\\ell _ 1\/2$$ regularized low-rank representation and sparse representation-based graph cuts. IEEE J Sel Topics Appl Earth Obs Remote Sens 8(6):2473\u20132484. https:\/\/doi.org\/10.1109\/JSTARS.2015.2423278","journal-title":"IEEE J Sel Topics Appl Earth Obs Remote Sens"},{"issue":"3","key":"4385_CR8","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1007\/s11227-020-03361-4","volume":"77","author":"MM Hassan","year":"2021","unstructured":"Hassan MM, Ullah S, Hossain MS et al (2021) An end-to-end deep learning model for human activity recognition from highly sparse body sensor data in Internet of Medical Things environment. J Supercomput 77(3):2237\u20132250. https:\/\/doi.org\/10.1007\/s11227-020-03361-4","journal-title":"J Supercomput"},{"key":"4385_CR9","doi-asserted-by":"publisher","first-page":"134971","DOI":"10.1016\/j.neulet.2020.134971","volume":"730","author":"J Jiang","year":"2020","unstructured":"Jiang J, Kang L, Huang J et al (2020) Deep learning based mild cognitive impairment diagnosis using structure MR images. Neurosci Lett 730:134971. https:\/\/doi.org\/10.1016\/j.neulet.2020.134971","journal-title":"Neurosci Lett"},{"issue":"11","key":"4385_CR10","doi-asserted-by":"publisher","first-page":"2804","DOI":"10.1109\/TSP.2018.2816575","volume":"66","author":"L Yang","year":"2018","unstructured":"Yang L, Fang J, Duan H et al (2018) Fast low-rank Bayesian matrix completion with hierarchical Gaussian prior models. IEEE Transact Signal Process 66(11):2804\u20132817. https:\/\/doi.org\/10.1109\/TSP.2018.2816575","journal-title":"IEEE Transact Signal Process"},{"issue":"10","key":"4385_CR11","doi-asserted-by":"publisher","first-page":"2580","DOI":"10.1109\/TSP.2019.2904021","volume":"67","author":"S Zhang","year":"2019","unstructured":"Zhang S, Wang M (2019) Correction of corrupted columns through fast robust Hankel matrix completion. IEEE Transact Signal Process 67(10):2580\u20132594. https:\/\/doi.org\/10.1109\/TSP.2019.2904021","journal-title":"IEEE Transact Signal Process"},{"issue":"6","key":"4385_CR12","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 EJ, Recht B (2009) Exact matrix completion via convex optimization. Found Comput Math 9(6):717\u2013772. https:\/\/doi.org\/10.1007\/s10208-009-9045-5","journal-title":"Found Comput Math"},{"key":"4385_CR13","doi-asserted-by":"publisher","unstructured":"Fazel M, Hindi H, Boyd S P (2001) A Rank Minimization Heuristic With Application to Minimum Order System Approximation. In: Proceedings of the 2001 American Control Conference. IEEE, 6: 4734-4739. https:\/\/doi.org\/10.1109\/ACC.2001.945730","DOI":"10.1109\/ACC.2001.945730"},{"issue":"5","key":"4385_CR14","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 Transact Inf Theory 56(5):2053\u20132080. https:\/\/doi.org\/10.1109\/TIT.2010.2044061","journal-title":"IEEE Transact Inf Theory"},{"key":"4385_CR15","doi-asserted-by":"publisher","unstructured":"Tan VYF, Balzano L, Draper SC (2011) Rank minimization over finite fields. In, (2011) IEEE international symposium on information theory proceedings. IEEE 1195\u20131199. https:\/\/doi.org\/10.1109\/ISIT.2011.6033722","DOI":"10.1109\/ISIT.2011.6033722"},{"issue":"4","key":"4385_CR16","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai JF, Cand\u00e8s EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956\u20131982. https:\/\/doi.org\/10.1137\/080738970","journal-title":"SIAM J Optim"},{"key":"4385_CR17","unstructured":"Jain P, Meka R, Dhillon I (2010) Guaranteed rank minimization via singular value projection. Adv in Neural Inf Process Syst, 23"},{"issue":"9","key":"4385_CR18","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2012","unstructured":"Hu Y, Zhang D, Ye J et al (2012) Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans on pattern analysis and machine intelligence 35(9):2117\u20132130. https:\/\/doi.org\/10.1109\/TPAMI.2012.271","journal-title":"IEEE Trans on pattern analysis and machine intelligence"},{"issue":"3","key":"4385_CR19","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10115-013-0713-z","volume":"42","author":"F Nie","year":"2015","unstructured":"Nie F, Wang H, Huang H et al (2015) Joint Schatten $$p$$-norm and $$\\ell _p$$-norm robust matrix completion for missing value recovery. Knowl Inf Syst 42(3):525\u2013544. https:\/\/doi.org\/10.1007\/s10115-013-0713-z","journal-title":"Knowl Inf Syst"},{"key":"4385_CR20","doi-asserted-by":"publisher","first-page":"103335","DOI":"10.1016\/j.jvcir.2021.103335","volume":"81","author":"L Yang","year":"2021","unstructured":"Yang L, Kou KI, Miao J (2021) Weighted truncated nuclear norm regularization for low-rank quaternion matrix completion. J Vis Commun Image Represent 81:103335. https:\/\/doi.org\/10.1016\/j.jvcir.2021.103335","journal-title":"J Vis Commun Image Represent"},{"key":"4385_CR21","doi-asserted-by":"publisher","first-page":"3132","DOI":"10.1109\/TIP.2019.2957925","volume":"29","author":"H Zhang","year":"2019","unstructured":"Zhang H, Qian J, Zhang B et al (2019) Low-rank matrix recovery via modified schatten-$$p$$ norm minimization with convergence guarantees. IEEE Trans Image Process 29:3132\u20133142. https:\/\/doi.org\/10.1109\/TIP.2019.2957925","journal-title":"IEEE Trans Image Process"},{"key":"4385_CR22","unstructured":"Fan J, Ding L, Chen Y, et al. (2019) Factor group-sparse regularization for efficient low-rank matrix recovery. Adv Neural Inf Process Syst, 32"},{"key":"4385_CR23","unstructured":"Nie F, Huang H, Cai X, et al. (2010) Efficient and Robust Feature Selection Via Joint $$\\ell$$2, 1-Norms Minimization. In: Proceedings of the 23rd International Conference on Neural Information Processing Systems-Volume 2. 1813-1821"},{"issue":"1","key":"4385_CR24","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay D, Mercier B (1976) A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput Math Appl 2(1):17\u201340. https:\/\/doi.org\/10.1016\/0898-1221(76)90003-1","journal-title":"Comput Math Appl"},{"key":"4385_CR25","unstructured":"Gerald C F. Applied numerical analysis (2004). Pearson Education India"},{"key":"4385_CR26","doi-asserted-by":"crossref","unstructured":"Boyd S, Parikh N, Chu E (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Now Publishers Inc","DOI":"10.1561\/9781601984616"},{"issue":"3","key":"4385_CR27","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1093\/imanum\/17.3.421","volume":"17","author":"B Blaschke","year":"1997","unstructured":"Blaschke B, Neubauer A, Scherzer O (1997) On convergence rates for the iteratively regularized Gauss-Newton method. IMA J Numer Anal 17(3):421\u2013436. https:\/\/doi.org\/10.1093\/imanum\/17.3.421","journal-title":"IMA J Numer Anal"},{"issue":"2","key":"4385_CR28","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1016\/j.amc.2006.01.076","volume":"181","author":"J Kou","year":"2006","unstructured":"Kou J, Li Y, Wang X (2006) A modification of Newton method with third-order convergence. Appl Math Comput 181(2):1106\u20131111. https:\/\/doi.org\/10.1016\/j.amc.2006.01.076","journal-title":"Appl Math Comput"},{"key":"4385_CR29","unstructured":"Li M, Kwok J T Y, L\u00fc B (2010) Making Large-Scale Nystr\u00f6m Approximation Possible. In: ICML 2010-proceedings, 27th International Conference on Machine Learning, 631"},{"key":"4385_CR30","unstructured":"Bertsekas D P (2014) Constrained optimization and lagrange multiplier methods. Academic press"},{"issue":"615\u2013640","key":"4385_CR31","first-page":"15","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh KC, Yun S (2010) An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pacific J Optim 6(615\u2013640):15","journal-title":"Pacific J Optim"},{"key":"4385_CR32","doi-asserted-by":"publisher","unstructured":"F. Maxwell Harper and Joseph A. Konstan (2015). The movielens datasets: History and context. ACM transactions on interactive intelligent systems (TiiS) 5, 4, Article 19 (December 2015), 19 pages. https:\/\/doi.org\/10.1145\/2827872","DOI":"10.1145\/2827872"},{"issue":"1","key":"4385_CR33","doi-asserted-by":"publisher","first-page":"3401","DOI":"10.5555\/2627435.2697073","volume":"15","author":"O Shamir","year":"2014","unstructured":"Shamir O, Shalev-Shwartz S (2014) Matrix completion with the trace norm: learning, bounding, and transducing. J Mach Learn Res 15(1):3401\u20133423. https:\/\/doi.org\/10.5555\/2627435.2697073","journal-title":"J Mach Learn Res"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04385-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04385-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04385-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T14:08:17Z","timestamp":1656943697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04385-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,13]]},"references-count":33,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["4385"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04385-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,13]]},"assertion":[{"value":"17 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}