{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:15:05Z","timestamp":1774120505105,"version":"3.50.1"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"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":["61602091"],"award-info":[{"award-number":["61602091"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61571102"],"award-info":[{"award-number":["61571102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["ZYGX2016J199"],"award-info":[{"award-number":["ZYGX2016J199"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["ZYGX2014Z003"],"award-info":[{"award-number":["ZYGX2014Z003"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/tmm.2018.2859026","type":"journal-article","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T19:01:27Z","timestamp":1532631687000},"page":"338-350","source":"Crossref","is-referenced-by-count":76,"title":["Image Completion Using Low Tensor Tree Rank and Total Variation Minimization"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2084-8781","authenticated-orcid":false,"given":"Yipeng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhen","family":"Long","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7607-707X","authenticated-orcid":false,"given":"Ce","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2012.2185054"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2017.2717502"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.02.028"},{"key":"ref32","first-page":"419","article-title":"Tensor completion in hierarchical tensor representations","author":"rauhut","year":"2015","journal-title":"Proc Compressed Sens Appl"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.04.015"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.08.010"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.607"},{"key":"ref36","article-title":"Tensor ring decomposition","author":"zhao","year":"2016","journal-title":"arXiv 1606 05535"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2420592"},{"key":"ref27","article-title":"Higher order matching pursuit for low rank tensor learning","author":"yang","year":"2015","journal-title":"arXiv 1503 02216"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2672439"},{"key":"ref2","first-page":"213","article-title":"Triplerank: Ranking semantic web data by tensor decomposition","author":"franz","year":"0","journal-title":"Proc Int Semantic Web Conf"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11045-013-0269-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2423694"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2010.2097588"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898346995"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/765782"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.409"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPCS.2016.7843326"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937655"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"ref55","first-page":"612","article-title":"Linearized Alternating Direction Method with Adaptive Penalty for Low Rank Representation","author":"lin","year":"2011","journal-title":"Advances Neural Inform Process Syst"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2579262"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74494-8_22"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2586759"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864727"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2151856"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TBME.2013.2264772"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref16","first-page":"2967","article-title":"A new convex relaxation for tensor completion","author":"romera-paredes","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-013-0455-z"},{"key":"ref18","first-page":"73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","author":"mu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","article-title":"Parallel matrix factorization for low-rank tensor completion","volume":"9","author":"xu","year":"2015","journal-title":"Inverse Problems Imag"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"ref3","author":"cichocki","year":"2009","journal-title":"Nonnegative Matrix and Tensor Factorizations Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2608780"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2629758"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2015.11.004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2791864"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2512329"},{"key":"ref9","article-title":"Multi-way analysis in the food industry: Models, algorithms, and applications","author":"bro","year":"1998","journal-title":"Dept Dairy Food Sci Royal Veterinary Agricultural Univ Denmark Københavns Universitet København Denmark"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/040605412"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-009-9094-9"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.049"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(92)90242-F"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TBME.2015.2411672"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:JMIV.0000011321.19549.88","article-title":"An algorithm for total variation minimization and applications","volume":"20","author":"chambolle","year":"2004","journal-title":"J Math Imag Vis"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/0917016"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6046\/8625851\/08421084.pdf?arnumber=8421084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:58:21Z","timestamp":1657745901000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8421084\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":59,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tmm.2018.2859026","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"value":"1520-9210","type":"print"},{"value":"1941-0077","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}