{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:42:05Z","timestamp":1775144525053,"version":"3.50.1"},"reference-count":60,"publisher":"IOP Publishing","issue":"3","license":[{"start":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T00:00:00Z","timestamp":1621209600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T00:00:00Z","timestamp":1621209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science, Russian Federation","doi-asserted-by":"crossref","award":["14.756.31.0001"],"award-info":[{"award-number":["14.756.31.0001"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["iopscience.iop.org"],"crossmark-restriction":false},"short-container-title":["Mach. Learn.: Sci. Technol."],"published-print":{"date-parts":[[2021,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Completing a data tensor with structured missing components is a challenging task where the missing components are not distributed randomly but they admit some regular patterns, e.g. missing columns and rows or missing blocks\/patches. Many of the existing tensor completion algorithms are not able to handle such scenarios. In this paper, we propose a novel and efficient approach for matrix\/tensor completion by applying Hankelization and distributed tensor ring decomposition. Our main idea is first Hankelizing an incomplete data tensor in order to obtain high-order tensors and then completing the data tensor by imposing sparse representation on the core tensors in tensor ring format. We apply an efficient over-complete discrete cosine transform dictionary and sparse representation techniques to learn core tensors. Alternating direction methods of multiplier and accelerated proximal gradient approaches are used to solve the underlying optimization problems. Extensive simulations performed on image, video completions and time series forecasting show the validity and applicability of the method for different kinds of structured and random missing elements.<\/jats:p>","DOI":"10.1088\/2632-2153\/abcb4f","type":"journal-article","created":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T05:48:24Z","timestamp":1605678504000},"page":"035008","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Matrix and tensor completion using tensor ring decomposition with sparse representation"],"prefix":"10.1088","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0400-2866","authenticated-orcid":false,"given":"Maame G","family":"Asante-Mensah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2614-0146","authenticated-orcid":false,"given":"Salman","family":"Ahmadi-Asl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8364-7226","authenticated-orcid":false,"given":"Andrzej","family":"Cichocki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"266","published-online":{"date-parts":[[2021,5,17]]},"reference":[{"key":"mlstabcb4fbib1","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","article-title":"Tensor completion for estimating missing values in visual data","volume":"35","author":"Liu","year":"2012","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"mlstabcb4fbib2","doi-asserted-by":"publisher","first-page":"1816","DOI":"10.1109\/TITS.2015.2507259","article-title":"Matrix and tensor based methods for missing data estimation in large traffic networks","volume":"17","author":"Asif","year":"2016","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"mlstabcb4fbib3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3278607","article-title":"Tensor completion algorithms in big data analytics","volume":"13","author":"Song","year":"2019","journal-title":"ACM Trans. Knowl. Discovery Data"},{"key":"mlstabcb4fbib4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.sigpro.2018.09.039","article-title":"Low rank tensor completion for multiway visual data","volume":"155","author":"Long","year":"2019","journal-title":"Signal Process."},{"key":"mlstabcb4fbib5","first-page":"pp 8251","article-title":"Missing slice recovery for tensors using a low-rank model in embedded space","author":"Yokota","year":"2018"},{"key":"mlstabcb4fbib6","first-page":"pp 3732","article-title":"Simultaneous visual data completion and denoising based on tensor rank and total variation minimization and its primal-dual splitting algorithm","author":"Yokota","year":"2017"},{"key":"mlstabcb4fbib7","article-title":"Spectral compressed sensing via structured matrix completion","author":"Chen","year":"2013"},{"key":"mlstabcb4fbib8","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1109\/LSP.2020.2990313","article-title":"Matrix and tensor completion in multiway delay embedded space using tensor train, with application to signal reconstruction","volume":"27","author":"Sedighin","year":"2020","journal-title":"IEEE Signal Process. Lett."},{"key":"mlstabcb4fbib9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"Boyd","year":"2011","journal-title":"Found. Trends Mach. Learn."},{"key":"mlstabcb4fbib10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1561\/2200000059","article-title":"Tensor networks for dimensionality reduction and large-scale optimization: part 1 perspectives and challenges","volume":"9","author":"Cichocki","year":"2016","journal-title":"Found. Trends Mach. Learn."},{"key":"mlstabcb4fbib11","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","article-title":"Tensor-train decomposition","volume":"33","author":"Oseledets","year":"2011","journal-title":"SIAM J. Sci. Comput."},{"key":"mlstabcb4fbib12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00365-011-9131-1","article-title":"O dlog N-quantics approximation of n-d tensors in high-dimensional numerical modeling","volume":"34","author":"Khoromskij","year":"2011","journal-title":"Constr. Approx."},{"key":"mlstabcb4fbib13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00791-012-0183-y","article-title":"Optimization problems in contracted tensor networks","volume":"14","author":"Espig","year":"2011","journal-title":"Comput. Vis. Sci."},{"key":"mlstabcb4fbib14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00791-014-0218-7","article-title":"A note on tensor chain approximation","volume":"15","author":"Espig","year":"2012","journal-title":"Comput. Vis. Sci."},{"key":"mlstabcb4fbib15","article-title":"Tensor ring decomposition","author":"Zhao","year":"2016"},{"key":"mlstabcb4fbib16","doi-asserted-by":"publisher","first-page":"2863","DOI":"10.1103\/PhysRevLett.69.2863","article-title":"Density matrix formulation for quantum renormalization groups","volume":"69","author":"White","year":"1992","journal-title":"Phys. Rev. Lett."},{"key":"mlstabcb4fbib17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.48.10345","article-title":"Density-matrix algorithms for quantum renormalization groups","volume":"48","author":"White","year":"1993","journal-title":"Phys. Rev. B"},{"key":"mlstabcb4fbib18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.aop.2010.09.012","article-title":"The density-matrix renormalization group in the age of matrix product states","volume":"326","author":"Schollw\u00f6ck","year":"2011","journal-title":"Ann. Phys."},{"key":"mlstabcb4fbib19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.aop.2014.06.013","article-title":"A practical introduction to tensor networks: matrix product states and projected entangled pair states","volume":"349","author":"Or\u00fas","year":"2014","journal-title":"Ann. Phys."},{"key":"mlstabcb4fbib20","doi-asserted-by":"crossref","DOI":"10.1088\/1751-8121\/aa6dc3","article-title":"Hand-waving and interpretive dance: an introductory course on tensor networks","volume":"50","author":"Bridgeman","year":"2017","journal-title":"J. Phys. A"},{"key":"mlstabcb4fbib21","article-title":"Quantum process tomography with unsupervised learning and tensor networks","author":"Torlai","year":"2020"},{"key":"mlstabcb4fbib22","article-title":"Tensor networks in a nutshell","author":"Biamonte","year":"2017"},{"key":"mlstabcb4fbib23","article-title":"Quantum machine learning tensor network states","author":"Biamonte","year":"2018"},{"key":"mlstabcb4fbib24","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1561\/2200000067","article-title":"Tensor networks for dimensionality reduction and large-scale optimizations: Part 2 applications and future perspectives","volume":"9","author":"Cichocki","year":"2017","journal-title":"Found. Trends Mach. Learn."},{"key":"mlstabcb4fbib25","article-title":"Era of big data processing: a new approach via tensor networks and tensor decompositions","author":"Cichocki","year":"2014"},{"key":"mlstabcb4fbib26","article-title":"A multi-scale tensor network architecture for classification and regression","author":"Reyes","year":"2020"},{"key":"mlstabcb4fbib27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.81.081103","article-title":"Efficient matrix-product state method for periodic boundary conditions","volume":"81","author":"Pippan","year":"2010","journal-title":"Phys. Rev. B"},{"key":"mlstabcb4fbib28","article-title":"Tensor-train recurrent neural networks for video classification","author":"Yang","year":"2017"},{"key":"mlstabcb4fbib29","first-page":"pp 4102","article-title":"A prior of a googol Gaussians: a tensor ring induced prior for generative models","author":"Kuznetsov","year":"2019"},{"key":"mlstabcb4fbib30","first-page":"pp 4799","article-title":"Supervised learning with tensor networks","author":"Stoudenmire","year":"2016"},{"key":"mlstabcb4fbib31","first-page":"pp 442","article-title":"Tensorizing neural networks","author":"Novikov","year":"2015"},{"key":"mlstabcb4fbib32","first-page":"pp 4451","article-title":"Compressing recurrent neural network with tensor train","author":"Tjandra","year":"2017"},{"key":"mlstabcb4fbib33","first-page":"pp 4683","article-title":"Compressing recurrent neural networks with tensor ring for action recognition","volume":"vol 33","author":"Pan","year":"2019"},{"key":"mlstabcb4fbib34","first-page":"pp 5697","article-title":"Efficient low rank tensor ring completion","author":"Wang","year":"2017"},{"key":"mlstabcb4fbib35","first-page":"pp 1071","article-title":"Higher-dimension tensor completion via low-rank tensor ring decomposition","author":"Yuan","year":"2018"},{"key":"mlstabcb4fbib36","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","article-title":"Efficient tensor completion for color image and video recovery: low-rank tensor train","volume":"26","author":"Bengua","year":"2017","journal-title":"IEEE Trans. Image Process."},{"key":"mlstabcb4fbib37","first-page":"pp 8608","article-title":"Learning efficient tensor representations with ring-structured networks","author":"Zhao","year":"2019"},{"key":"mlstabcb4fbib38","article-title":"Hyperspectral super-resolution via coupled tensor ring factorization","author":"He","year":"2020"},{"key":"mlstabcb4fbib39","doi-asserted-by":"publisher","first-page":"2672","DOI":"10.1109\/TNNLS.2018.2885616","article-title":"Learning a low tensor-train rank representation for hyperspectral image super-resolution","volume":"30","author":"Dian","year":"2019","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"mlstabcb4fbib40","volume":"vol 2045","author":"Bellman","year":"2015"},{"key":"mlstabcb4fbib41","doi-asserted-by":"publisher","DOI":"10.1088\/2632-2153\/abad87","article-title":"Randomized algorithms for fast computation of low-rank tensor ring model","volume":"2","author":"Ahmadi-Asl","year":"2020","journal-title":"Mach. Learn.: Sci. Technol."},{"key":"mlstabcb4fbib42","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3037923","article-title":"Manifold modeling in embedded space: an interpretable alternative to deep image prior","author":"Yokota","year":"2020","journal-title":"IEEE Trans. Neural Networks Learning Systems"},{"key":"mlstabcb4fbib43","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1109\/JSTSP.2018.2873990","article-title":"Tensor completion from structurally-missing entries by low-TT-rankness and fiber-wise sparsity","volume":"12","author":"Yang","year":"2018","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"mlstabcb4fbib44","doi-asserted-by":"publisher","first-page":"3336","DOI":"10.1109\/TIP.2014.2323127","article-title":"Group-based sparse representation for image restoration","volume":"23","author":"Zhang","year":"2014","journal-title":"IEEE Trans. Image Process."},{"key":"mlstabcb4fbib45","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1109\/TIP.2006.881969","article-title":"Image denoising via sparse and redundant representations over learned dictionaries","volume":"15","author":"Elad","year":"2006","journal-title":"IEEE Trans. Image Process."},{"key":"mlstabcb4fbib46","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","article-title":"K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation","volume":"54","author":"Aharon","year":"2006","journal-title":"IEEE Trans. Signal Process."},{"key":"mlstabcb4fbib47","first-page":"pp 689","article-title":"Online dictionary learning for sparse coding","author":"Mairal","year":"2009"},{"key":"mlstabcb4fbib48","doi-asserted-by":"publisher","first-page":"167","DOI":"10.3390\/sym10050167","article-title":"Image denoising via improved dictionary learning with global structure and local similarity preservations","volume":"10","author":"Cai","year":"2018","journal-title":"Symmetry"},{"key":"mlstabcb4fbib49","first-page":"pp 9151","article-title":"Tensor ring decomposition with rank minimization on latent space: an efficient approach for tensor completion","volume":"vol 33","author":"Yuan","year":"2019"},{"key":"mlstabcb4fbib50","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1109\/TCI.2020.3006718","article-title":"Robust low-rank tensor ring completion","volume":"6","author":"Huang","year":"2020","journal-title":"IEEE Trans. Comput. Imaging"},{"key":"mlstabcb4fbib51","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10994-019-05846-7","article-title":"Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion","volume":"109","author":"Yuan","year":"2020","journal-title":"Mach. Learn."},{"key":"mlstabcb4fbib52","doi-asserted-by":"publisher","first-page":"131888","DOI":"10.1109\/ACCESS.2019.2940255","article-title":"Low-rank tensor completion via tensor nuclear norm with hybrid smooth regularization","volume":"7","author":"Zhao","year":"2019","journal-title":"IEEE Access"},{"key":"mlstabcb4fbib53","article-title":"Tensor completion via nonconvex tensor ring rank minimization with guaranteed convergence","author":"Ding","year":"2020"},{"key":"mlstabcb4fbib54","first-page":"15","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"Toh","year":"2010","journal-title":"Pac. J. Optim."},{"key":"mlstabcb4fbib55","first-page":"53","article-title":"High-order tensor completion via gradient-based optimization under tensor train format","volume":"73","author":"Yuan","year":"2019","journal-title":"Signal Process.: Image Commun."},{"key":"mlstabcb4fbib56","article-title":"Poblano v1. 0: a matlab toolbox for gradient-based optimization","author":"Dunlavy","year":"2010"},{"key":"mlstabcb4fbib57","article-title":"Tensor ring decomposition with rank minimization on latent space: an efficient approach for tensor completion","author":"Yuan","year":"2018"},{"key":"mlstabcb4fbib58","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.chemolab.2010.08.004","article-title":"Scalable tensor factorizations for incomplete data","volume":"106","author":"Acar","year":"2011","journal-title":"Chemometr. Intell. Lab. Syst."},{"key":"mlstabcb4fbib59","doi-asserted-by":"publisher","first-page":"5423","DOI":"10.1109\/TSP.2016.2586759","article-title":"Smooth PARAFAC decomposition for tensor completion","volume":"64","author":"Yokota","year":"2016","journal-title":"IEEE Trans. Signal Process."},{"key":"mlstabcb4fbib60","article-title":"Pistol shot recorded at 73 000 frames per second","author":"","year":"2015"}],"container-title":["Machine Learning: Science and Technology"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/abcb4f","content-type":"text\/html","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/abcb4f\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/abcb4f","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/abcb4f\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/abcb4f\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/abcb4f\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/abcb4f\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/abcb4f\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T01:57:04Z","timestamp":1643421424000},"score":1,"resource":{"primary":{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/abcb4f"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,17]]},"references-count":60,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,5,17]]},"published-print":{"date-parts":[[2021,9,1]]}},"URL":"https:\/\/doi.org\/10.1088\/2632-2153\/abcb4f","relation":{},"ISSN":["2632-2153"],"issn-type":[{"value":"2632-2153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,17]]},"assertion":[{"value":"Matrix and tensor completion using tensor ring decomposition with sparse representation","name":"article_title","label":"Article Title"},{"value":"Machine Learning: Science and Technology","name":"journal_title","label":"Journal Title"},{"value":"paper","name":"article_type","label":"Article Type"},{"value":"\u00a9 2021 The Author(s). Published by IOP Publishing Ltd","name":"copyright_information","label":"Copyright Information"},{"value":"2020-09-04","name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2020-11-17","name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2021-05-17","name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}