{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T02:37:47Z","timestamp":1730342267083,"version":"3.28.0"},"reference-count":78,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.23919\/apsipa.2018.8659530","type":"proceedings-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T23:11:49Z","timestamp":1552950709000},"page":"1325-1333","source":"Crossref","is-referenced-by-count":9,"title":["Tensor Completion with Shift-invariant Cosine Bases"],"prefix":"10.23919","author":[{"given":"Tatsuya","family":"Yokota","sequence":"first","affiliation":[]},{"given":"Hidekata","family":"Hontani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","first-page":"222","article-title":"Completion of high order tensor data with missing entries via tensor-train decomposition","author":"yuan","year":"2017","journal-title":"Proc ICONIP"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0682-2"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2586759"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2620965"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"journal-title":"Bayesian sparse Tucker models for dimension reduction and tensor completion","year":"2015","author":"zhao","key":"ref77"},{"key":"ref74","first-page":"1","article-title":"On tensor completion via nuclear norm minimization","author":"yuan","year":"2014","journal-title":"Foundations of Computational Mathematics"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/78.554314"},{"journal-title":"High-dimension tensor completion via gradient-based optimization under tensor-train format","year":"2018","author":"zhao","key":"ref75"},{"key":"ref38","first-page":"2210","article-title":"Low-rank tensor completion with total variation for visual data inpainting","author":"li","year":"2017","journal-title":"Proceedings of AAAI"},{"key":"ref78","first-page":"8","article-title":"An efficient primal-dual hybrid gradient algorithm for total variation image restoration","author":"zhu","year":"2008","journal-title":"UCLA CAM report"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref32","first-page":"952","article-title":"Matrix completion from noisy entries","author":"keshavan","year":"2009","journal-title":"Proceedings of NIPS"},{"key":"ref31","first-page":"1012","article-title":"Low-rank tensor completion: a Riemannian manifold preconditioning approach","author":"kasai","year":"2016","journal-title":"Proceedings of ICML"},{"key":"ref30","article-title":"Parallel algorithms for tensor completion in the CP format","author":"karlsson","year":"2015","journal-title":"Parallel Computing"},{"key":"ref37","first-page":"418","article-title":"Multi-filters guided low-rank tensor coding for image inpainting","author":"li","year":"2017","journal-title":"Proc ICIVC"},{"key":"ref36","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"Proceedings of NIPS"},{"key":"ref35","first-page":"836","article-title":"Low-rank matrix and tensor completion via adaptive sampling","author":"krishnamurthy","year":"2013","journal-title":"Proceedings of NIPS"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-013-0455-z"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2420592"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/449"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/SCIS-ISIS.2014.7044685"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298983"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/APSIPA.2015.7415348"},{"key":"ref27","first-page":"1","article-title":"Total variation based interpolation","author":"guichard","year":"1998","journal-title":"Proceedings of EUSIPCO"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472130"},{"key":"ref66","first-page":"8251","article-title":"Missing slice recovery for tensors using a low-rank model in embedded space","author":"yokota","year":"2018","journal-title":"proceedings of CVPR"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/765782"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/APSIPA.2017.8282164"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.409"},{"journal-title":"Simultaneous tensor completion and denoising by noise inequality constrained convex optimization","year":"2018","author":"yokota","key":"ref69"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2672439"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2016.2595329"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/09076934X"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.93.042218"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11045-013-0269-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/130942401"},{"key":"ref25","first-page":"2089","article-title":"Adaptive primal-dual splitting methods for statistical learning and image processing","author":"goldstein","year":"2015","journal-title":"Proceedings of NIPS"},{"key":"ref50","first-page":"1800","article-title":"Scalable Bayesian low-rank decomposition of incomplete multiway tensors","author":"rai","year":"2014","journal-title":"Proceedings of ICML"},{"journal-title":"Optimal low-rank tensor recovery from separable measurements Four contractions suffice","year":"2015","author":"shah","key":"ref51"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2806225"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329429"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1991.261604"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2015.7148925"},{"key":"ref54","first-page":"1539","article-title":"Riemannian pursuit for big matrix recovery","author":"tan","year":"2014","journal-title":"Proceedings of ICML"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.1996.560871"},{"key":"ref52","first-page":"155","article-title":"Low-rank total variation for image super-resolution","author":"shi","year":"2013","journal-title":"Proceedings of MICCAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"journal-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","year":"2010","author":"lin","key":"ref40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drq039"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.164"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0245-9"},{"journal-title":"The Physics of Compressive Sensing and the Gradient-Based Recovery Algorithms","year":"2009","author":"dai","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"journal-title":"Parallel and Distributed Computation Numerical Methods","year":"1989","author":"bertsekas","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPCS.2016.7843326"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.02.027"},{"key":"ref5","first-page":"406","article-title":"Rtrmc: A Riemannian trust-region method for low-rank matrix completion","author":"boumal","year":"2011","journal-title":"Proceedings of NIPS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref7","first-page":"1455","article-title":"Manopt, a Matlab toolbox for optimization on manifolds","volume":"15","author":"boumal","year":"2014","journal-title":"The Journal of Machine Learning Research"},{"key":"ref49","first-page":"1994","article-title":"Coping with chaos. analysis of chaotic data and the exploitation of chaotic systems","author":"ott","year":"1994","journal-title":"Wiley Series in Nonlinear Science"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"journal-title":"A Riemannian geometry for low-rank matrix completion","year":"2012","author":"mishra","key":"ref46"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1016\/j.automatica.2007.09.011","article-title":"Structured low-rank approximation and its applications","volume":"44","author":"markovsky","year":"2008","journal-title":"Automatica"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s00180-013-0464-z"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/110859646"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref41","first-page":"2114","article-title":"Tensor completion for estimating missing values in visual data","author":"liu","year":"2009","journal-title":"Proceedings of ICCV"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.04.046"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2017.8296653"}],"event":{"name":"2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)","start":{"date-parts":[[2018,11,12]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2018,11,15]]}},"container-title":["2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8648538\/8659446\/08659530.pdf?arnumber=8659530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:20:00Z","timestamp":1598221200000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8659530\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":78,"URL":"https:\/\/doi.org\/10.23919\/apsipa.2018.8659530","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}