{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T22:24:53Z","timestamp":1785363893597,"version":"3.55.0"},"reference-count":82,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"20","license":[{"start":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T00:00:00Z","timestamp":1476489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15K16067"],"award-info":[{"award-number":["15K16067"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15K15955"],"award-info":[{"award-number":["15K15955"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2016,10,15]]},"DOI":"10.1109\/tsp.2016.2586759","type":"journal-article","created":{"date-parts":[[2016,6,30]],"date-time":"2016-06-30T20:09:43Z","timestamp":1467317383000},"page":"5423-5436","source":"Crossref","is-referenced-by-count":254,"title":["Smooth PARAFAC Decomposition for Tensor Completion"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7368-2060","authenticated-orcid":false,"given":"Tatsuya","family":"Yokota","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qibin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Cichocki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5652280"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxp008"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0682-2"},{"key":"ref77","first-page":"1","article-title":"On tensor completion via nuclear norm minimization","author":"yuan","year":"2014","journal-title":"Found Comput Math"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/APSIPA.2015.7415348"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15558-1_57"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2015.02.003"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-012-9176-9"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34475-6_74"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69162-4_54"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I"},{"key":"ref31","article-title":"Parallel algorithms for tensor completion in the CP format","author":"karlsson","year":"2015","journal-title":"Parallel Comput"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12521"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5651225"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-013-0455-z"},{"key":"ref34","first-page":"50","article-title":"Method of stochastic approximation in the determination of the largest eigenvalue of the mathematical expectation of random matrices","author":"krasulina","year":"1970","journal-title":"Autom Remote Control"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2400415"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.11.020"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494274374"},{"key":"ref63","first-page":"1539","article-title":"Riemannian pursuit for big matrix recovery","author":"tan","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref28","article-title":"Foundations of the PARAFAC procedure: Model and conditions for an &#x2018;explanatory&#x2019; multi-mode factor analysis","volume":"16","author":"harshman","year":"1970","journal-title":"UCLA Working Papers Phonetics"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.6.520"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/765782"},{"key":"ref65","first-page":"122","article-title":"Implications of factor analysis of three-way matrices for measurement of change","author":"tucker","year":"1963","journal-title":"Problems in Measuring Change"},{"key":"ref66","first-page":"309","article-title":"A new convergence proof for the high-order power method and generalizations","volume":"11","author":"uschmajew","year":"2015","journal-title":"Pac J Optim"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2015.7148925"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1137\/130938207"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1137\/080724265"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"ref1","author":"absil","year":"2009","journal-title":"Optimization Algorithms on Matrix Manifolds"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/78.845952"},{"key":"ref22","article-title":"Nuclear norm of higher-order tensors","author":"friedland","year":"2016","journal-title":"arXiv preprint arXiv 1410 6072 v3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2012.2228474"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2010.2097588"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/040608982"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/110820361"},{"key":"ref50","first-page":"1800","article-title":"Scalable Bayesian low-rank decomposition of incomplete multiway tensors","author":"rai","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2257813"},{"key":"ref59","article-title":"Tensorlab, v2. 0","author":"sorber","year":"2014"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1137\/120868323"},{"key":"ref57","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1109\/TPAMI.2003.1251154","article-title":"The CMU pose, illumination, and expression database","volume":"25","author":"sim","year":"2003","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref56","article-title":"Optimal low-rank tensor recovery from separable measurements: Four contractions suffice","author":"shah","year":"2015"},{"key":"ref55","article-title":"Total variation denoising (an mm algorithm)","author":"selesnick","year":"2012","journal-title":"NYU Polytechnic School of Engineering Lecture Notes"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(92)90242-F"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1002\/cem.749"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2158229"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drq039"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5654055"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.164"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74494-8_22"},{"key":"ref14","author":"cichocki","year":"2009","journal-title":"Nonnegative Matrix and Tensor Factorizations Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation"},{"key":"ref15","volume":"1","author":"courant","year":"1966","journal-title":"Methods of Mathematical Physics"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.833105"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899352045"},{"key":"ref17","article-title":"The physics of compressive sensing and the gradient-based recovery algorithms","author":"dai","year":"2009","journal-title":"arXiv preprint arXiv 0906 1487"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/06066518X"},{"key":"ref19","article-title":"Alternating minimal energy methods for linear systems in higher dimensions. Part I: SPD systems","author":"dolgov","year":"2013","journal-title":"ArXiv e-print arXiv 1301 6068"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07176-3_7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273499"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2013.6714047"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2028250"},{"key":"ref5","first-page":"41","article-title":"Multi-task feature learning","author":"argyriou","year":"2007","journal-title":"Advances in Neural Information Processing Systems 19"},{"key":"ref8","author":"bertsekas","year":"1989","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref7","author":"bertsekas","year":"2015","journal-title":"On Algorithms for Non Convex Optimization"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1978.1170425"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/090774823"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/110859646"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/040605412"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2009.03.018"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref41","article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010"},{"key":"ref44","first-page":"396","article-title":"Hole-filling by rank sparsity tensor decomposition for medical imaging","volume":"94","author":"lv","year":"2011","journal-title":"IEICE Trans Inf Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/iel7\/78\/7547350\/07502115.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/7547350\/07502115.pdf?arnumber=7502115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:15Z","timestamp":1642004775000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7502115\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,15]]},"references-count":82,"journal-issue":{"issue":"20"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2016.2586759","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,15]]}}}