{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:30:31Z","timestamp":1773775831282,"version":"3.50.1"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61325007"],"award-info":[{"award-number":["61325007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Cooperation and Exchanges","award":["61520106001"],"award-info":[{"award-number":["61520106001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/tcyb.2018.2825598","type":"journal-article","created":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T19:02:37Z","timestamp":1525460557000},"page":"2344-2354","source":"Crossref","is-referenced-by-count":51,"title":["Tensor Completion via Nonlocal Low-Rank Regularization"],"prefix":"10.1109","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0243-3112","authenticated-orcid":false,"given":"Ting","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0585-9848","authenticated-orcid":false,"given":"Shutao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2351-4461","authenticated-orcid":false,"given":"Leyuan","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4891-9211","authenticated-orcid":false,"given":"Licheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2423694"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.61"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref31","first-page":"1","article-title":"Foundations of the PARAFAC procedure: Models and conditions for an ‘explanatory’ multi-modal factor analysis","volume":"16","author":"harshman","year":"1970","journal-title":"UCLA Working Papers Phonetics"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2015.9.601"},{"key":"ref37","first-page":"73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","author":"mu","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2512329"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/120899066"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.10.002"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2374695"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2376938"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.39"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1137\/S0036139900368844","article-title":"Mathematical models for local nontexture inpaintings","volume":"62","author":"chan","year":"2002","journal-title":"SIAM J Appl Math"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344972"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2010.5531594"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2307854"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2276430"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2521428"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2010.2097588"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1109\/TSMCB.2007.911536","article-title":"Discriminant locally linear embedding with high-order tensor data","volume":"38","author":"li","year":"2008","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2046811"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2013.2240001"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2017.2664480"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2017.2768479"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.411"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1364\/JOSAA.23.002359"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2231411"},{"key":"ref11","article-title":"Matrix rank minimization with applications","author":"fazel","year":"2002"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1109\/TSMCB.2012.2185490","article-title":"Robust alternative minimization for matrix completion","volume":"42","author":"lu","year":"2012","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref16","first-page":"2016","article-title":"Scalable algorithms for tractable Schatten quasi-norm minimization","author":"shang","year":"2016","journal-title":"Proc 30th AAAI Conf Artif Intell"},{"key":"ref17","first-page":"620","article-title":"Tractable and scalable Schatten quasi-norm approximations for rank minimization","author":"shang","year":"2016","journal-title":"Proc 19th Int Conf Artif Intell"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783303"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2454521"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.141"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2286106"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2519532"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.903263"},{"key":"ref49","first-page":"1027","article-title":"K-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2457611"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2587825"},{"key":"ref46","first-page":"1763","article-title":"Generalized higher-order orthogonal iteration for tensor decomposition and completion","author":"liu","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2329449"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2254477"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2465178"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.10.030"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8676036\/08354934.pdf?arnumber=8354934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:06Z","timestamp":1657745526000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8354934\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":56,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2018.2825598","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6]]}}}