{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T21:23:28Z","timestamp":1776720208899,"version":"3.51.2"},"reference-count":60,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T00:00:00Z","timestamp":1706054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["62103110"],"award-info":[{"award-number":["62103110"]}]},{"name":"National Natural Science Foundation of China","award":["62071132"],"award-info":[{"award-number":["62071132"]}]},{"name":"National Natural Science Foundation of China","award":["62203124"],"award-info":[{"award-number":["62203124"]}]},{"name":"National Natural Science Foundation of China","award":["No. 2023A1515012916"],"award-info":[{"award-number":["No. 2023A1515012916"]}]},{"name":"Guangdong Natural Science Foundation","award":["62103110"],"award-info":[{"award-number":["62103110"]}]},{"name":"Guangdong Natural Science Foundation","award":["62071132"],"award-info":[{"award-number":["62071132"]}]},{"name":"Guangdong Natural Science Foundation","award":["62203124"],"award-info":[{"award-number":["62203124"]}]},{"name":"Guangdong Natural Science Foundation","award":["No. 2023A1515012916"],"award-info":[{"award-number":["No. 2023A1515012916"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>As a promising data analysis technique, sparse modeling has gained widespread traction in the field of image processing, particularly for image recovery. The matrix rank, served as a measure of data sparsity, quantifies the sparsity within the Kronecker basis representation of a given piece of data in the matrix format. Nevertheless, in practical scenarios, much of the data are intrinsically multi-dimensional, and thus, using a matrix format for data representation will inevitably yield sub-optimal outcomes. Tensor decomposition (TD), as a high-order generalization of matrix decomposition, has been widely used to analyze multi-dimensional data. In a direct generalization to the matrix rank, low-rank tensor modeling has been developed for multi-dimensional data analysis and achieved great success. Despite its efficacy, the connection between TD rank and the sparsity of the tensor data is not direct. In this work, we introduce a novel tensor ring sparsity measurement (TRSM) for measuring the sparsity of the tensor. This metric relies on the tensor ring (TR) Kronecker basis representation of the tensor, providing a unified interpretation akin to matrix sparsity measurements, wherein the Kronecker basis serves as the foundational representation component. Moreover, TRSM can be efficiently computed by the product of the ranks of the mode-2 unfolded TR-cores. To enhance the practical performance of TRSM, the folded-concave penalty of the minimax concave penalty is introduced as a nonconvex relaxation. Lastly, we extend the TRSM to the tensor completion problem and use the alternating direction method of the multipliers scheme to solve it. Experiments on image and video data completion demonstrate the effectiveness of the proposed method.<\/jats:p>","DOI":"10.3390\/e26020105","type":"journal-article","created":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T09:57:42Z","timestamp":1706090262000},"page":"105","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Novel Tensor Ring Sparsity Measurement for Image Completion"],"prefix":"10.3390","volume":"26","author":[{"given":"Junhua","family":"Zeng","sequence":"first","affiliation":[{"name":"School of Automation, Guangdong University of Technology, Guangzhou 510006, China"},{"name":"RIKEN Center for Advanced Intelligence Project (AIP), Tokyo 103-0027, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0268-0890","authenticated-orcid":false,"given":"Yuning","family":"Qiu","sequence":"additional","affiliation":[{"name":"School of Automation, Guangdong University of Technology, Guangzhou 510006, China"},{"name":"RIKEN Center for Advanced Intelligence Project (AIP), Tokyo 103-0027, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yumeng","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Automation, Guangdong University of Technology, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0412-2120","authenticated-orcid":false,"given":"Andong","family":"Wang","sequence":"additional","affiliation":[{"name":"RIKEN Center for Advanced Intelligence Project (AIP), Tokyo 103-0027, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qibin","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Automation, Guangdong University of Technology, Guangzhou 510006, China"},{"name":"RIKEN Center for Advanced Intelligence Project (AIP), Tokyo 103-0027, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,1,24]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Bertalmio, M., Sapiro, G., Caselles, V., and Ballester, C. (2000, January 23\u201328). Image inpainting. Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, New Orleans, LA, USA.","DOI":"10.1145\/344779.344972"},{"key":"ref_2","unstructured":"Komodakis, N. (2006, January 17\u201322). Image completion using global optimization. Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR\u201906), New York, NY, USA."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"8998","DOI":"10.1109\/TGRS.2019.2924017","article-title":"Remote sensing image reconstruction using tensor ring completion and total variation","volume":"57","author":"He","year":"2019","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Ding, T., Sznaier, M., and Camps, O.I. (2007, January 14\u201321). A rank minimization approach to video inpainting. Proceedings of the 2007 IEEE 11th International Conference on Computer Vision, Rio De Janeiro, Brazil.","DOI":"10.1109\/ICCV.2007.4408932"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.sigpro.2017.06.017","article-title":"Simultaneous denoising and interpolation of 2D seismic data using data-driven non-negative dictionary learning","volume":"141","author":"Siahsar","year":"2017","journal-title":"Signal Process."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"V385","DOI":"10.1190\/geo2017-0084.1","article-title":"Data-driven multitask sparse dictionary learning for noise attenuation of 3D seismic data","volume":"82","author":"Gholtashi","year":"2017","journal-title":"Geophysics"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"4434","DOI":"10.1038\/s41467-019-12405-0","article-title":"Obtaining free USArray data by multi-dimensional seismic reconstruction","volume":"10","author":"Chen","year":"2019","journal-title":"Nat. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"022411","DOI":"10.1103\/PhysRevE.96.022411","article-title":"Anisotropic interaction rules in circular motions of pigeon flocks: An empirical study based on sparse Bayesian learning","volume":"96","author":"Chen","year":"2017","journal-title":"Phys. Rev. E"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1007975506780","article-title":"On photometric issues in 3D visual recognition from a single 2D image","volume":"21","author":"Shashua","year":"1997","journal-title":"Int. J. Comput. Vis."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"033003","DOI":"10.1117\/1.3456695","article-title":"Comparative study of background subtraction algorithms","volume":"19","author":"Benezeth","year":"2010","journal-title":"J. Electron. Imaging"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"4075","DOI":"10.1109\/TIP.2016.2579262","article-title":"Total variation regularized tensor RPCA for background subtraction from compressive measurements","volume":"25","author":"Cao","year":"2016","journal-title":"IEEE Trans. Image Process."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MSP.2007.914728","article-title":"Compressed sensing MRI","volume":"25","author":"Lustig","year":"2008","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1002\/mrm.21691","article-title":"Image reconstruction by regularized nonlinear inversion\u2014joint estimation of coil sensitivities and image content","volume":"60","author":"Uecker","year":"2008","journal-title":"Magn. Reson. Med."},{"key":"ref_14","first-page":"273","article-title":"Noisy Tensor Completion via Orientation Invariant Tubal Nuclear Norm","volume":"19","author":"Wang","year":"2023","journal-title":"Pac. J. Optim."},{"key":"ref_15","unstructured":"Wright, J., Ganesh, A., Rao, S., and Ma, Y. (2009). Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization, Coordinated Science Laboratory. Report No. UILU-ENG-09-2210, DC-243."},{"key":"ref_16","unstructured":"Zhao, Q., Meng, D., Xu, Z., Zuo, W., and Zhang, L. (2014, January 22\u201324). Robust principal component analysis with complex noise. Proceedings of the International Conference on Machine Learning, PMLR, Beijing, China."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","article-title":"A singular value thresholding algorithm for matrix completion","volume":"20","author":"Cai","year":"2010","journal-title":"SIAM J. Optim."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","article-title":"Fixed point and Bregman iterative methods for matrix rank minimization","volume":"128","author":"Ma","year":"2011","journal-title":"Math. Program."},{"key":"ref_19","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"Recht","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","article-title":"The power of convex relaxation: Near-optimal matrix completion","volume":"56","author":"Tao","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/LSP.2011.2151856","article-title":"Tensor versus matrix completion: A comparison with application to spectral data","volume":"18","author":"Signoretto","year":"2011","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TAP.2021.3090835","article-title":"Compression of volume-surface integral equation matrices via Tucker decomposition for magnetic resonance applications","volume":"70","author":"Giannakopoulos","year":"2021","journal-title":"IEEE Trans. Antennas Propag."},{"key":"ref_23","unstructured":"Giannakopoulos, I.I., Guryev, G.D., Serrall\u00e9s, J.E., Georgakis, I.P., Daniel, L., White, J.K., and Lattanzi, R. (2021, January 28\u201331). A tensor train compression scheme for remote volume-surface integral equation interactions. Proceedings of the 2021 International Applied Computational Electromagnetics Society Symposium (ACES), Chengdu, China."},{"key":"ref_24","first-page":"1","article-title":"From matrix to tensor: Multilinear algebra and signal processing","volume":"Volume 67","year":"1998","journal-title":"Proceedings of the Institute of Mathematics and Its Applications Conference Series"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2377","DOI":"10.1109\/78.852018","article-title":"Parallel factor analysis in sensor array processing","volume":"48","author":"Sidiropoulos","year":"2000","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TCYB.2020.2979344","article-title":"A generalized graph regularized non-negative tucker decomposition framework for tensor data representation","volume":"52","author":"Qiu","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_27","unstructured":"Vasilescu, M.A.O., and Terzopoulos, D. (2002). Proceedings of the European Conference on Computer Vision, Springer."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1109\/TNNLS.2022.3181378","article-title":"Noisy tensor completion via low-rank tensor ring","volume":"35","author":"Qiu","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Zheng, Y.B., Huang, T.Z., Zhao, X.L., Zhao, Q., and Jiang, T.X. (2021, January 2\u20139). Fully-connected tensor network decomposition and its application to higher-order tensor completion. Proceedings of the AAAI Conference on Artificial Intelligence, Online.","DOI":"10.1609\/aaai.v35i12.17321"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02310791","article-title":"Analysis of individual differences in multidimensional scaling via an N-way generalization of \u201cEckart-Young\u201d decomposition","volume":"35","author":"Carroll","year":"1970","journal-title":"Psychometrika"},{"key":"ref_31","unstructured":"H\u00e5stad, J. (1989). Proceedings of the International Colloquium on Automata, Languages, and Programming, Springer."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.ins.2020.05.005","article-title":"Tensor N-tubal rank and its convex relaxation for low-rank tensor recovery","volume":"532","author":"Zheng","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02289464","article-title":"Some mathematical notes on three-mode factor analysis","volume":"31","author":"Tucker","year":"1966","journal-title":"Psychometrika"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1109\/TCSVT.2019.2901311","article-title":"Low CP rank and tucker rank tensor completion for estimating missing components in image data","volume":"30","author":"Liu","year":"2019","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"4077","DOI":"10.1109\/TSP.2023.3327845","article-title":"Bayesian Tensor Tucker Completion with A Flexible Core","volume":"71","author":"Tong","year":"2023","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1561\/2200000059","article-title":"Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions","volume":"9","author":"Cichocki","year":"2016","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Cichocki, A., Phan, A.H., Zhao, Q., Lee, N., Oseledets, I.V., Sugiyama, M., and Mandic, D. (2017). Tensor networks for dimensionality reduction and large-scale optimizations. part 2 applications and future perspectives. arXiv.","DOI":"10.1561\/9781680832778"},{"key":"ref_38","doi-asserted-by":"crossref","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":"ref_39","doi-asserted-by":"crossref","first-page":"2130","DOI":"10.1137\/090757861","article-title":"Approximation of 2d \u00d7 2d matrices using tensor decomposition","volume":"31","author":"Oseledets","year":"2010","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"ref_40","unstructured":"Zhao, Q., Zhou, G., Xie, S., Zhang, L., and Cichocki, A. (2016). Tensor ring decomposition. arXiv."},{"key":"ref_41","doi-asserted-by":"crossref","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":"ref_42","unstructured":"Yuan, L., Li, C., Mandic, D., Cao, J., and Zhao, Q. (February, January 27). Tensor ring decomposition with rank minimization on latent space: An efficient approach for tensor completion. Proceedings of the AAAI Conference on Artificial Intelligence, Honolulu, HI, USA."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"3020","DOI":"10.1109\/TNNLS.2020.3009210","article-title":"Low tensor-ring rank completion by parallel matrix factorization","volume":"32","author":"Yu","year":"2020","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"4567","DOI":"10.1109\/TNNLS.2019.2956153","article-title":"Enhanced sparsity prior model for low-rank tensor completion","volume":"31","author":"Xue","year":"2019","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"6916","DOI":"10.1109\/TNNLS.2021.3083931","article-title":"Multilayer sparsity-based tensor decomposition for low-rank tensor completion","volume":"33","author":"Xue","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Zhao, Q., Meng, D., Kong, X., Xie, Q., Cao, W., Wang, Y., and Xu, Z. (2015, January 7\u201313). A novel sparsity measure for tensor recovery. Proceedings of the IEEE International Conference on Computer Vision, Santiago, Chile.","DOI":"10.1109\/ICCV.2015.39"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1888","DOI":"10.1109\/TPAMI.2017.2734888","article-title":"Kronecker-basis-representation based tensor sparsity and its applications to tensor recovery","volume":"40","author":"Xie","year":"2017","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda","year":"2009","journal-title":"SIAM Rev."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","article-title":"Nearly unbiased variable selection under minimax concave penalty","volume":"38","author":"Zhang","year":"2010","journal-title":"Ann. Stat."},{"key":"ref_50","unstructured":"Xu, Y., Hao, R., Yin, W., and Su, Z. (2013). Parallel matrix factorization for low-rank tensor completion. arXiv."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.1109\/TPAMI.2015.2392756","article-title":"Bayesian CP factorization of incomplete tensors with automatic rank determination","volume":"37","author":"Zhao","year":"2015","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_52","unstructured":"Morup, M., Dunlavy, D.M., Acar, E., and Kolda, T.G. (2010). Technical Report, Sandia National Laboratories."},{"key":"ref_53","doi-asserted-by":"crossref","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":"ref_54","doi-asserted-by":"crossref","unstructured":"Yuan, L., Cao, J., Zhao, X., Wu, Q., and Zhao, Q. (2018, January 12\u201315). Higher-dimension tensor completion via low-rank tensor ring decomposition. Proceedings of the 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), Honolulu, HI, USA.","DOI":"10.23919\/APSIPA.2018.8659708"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.image.2018.11.012","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":"ref_56","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIP.2003.819861","article-title":"Image quality assessment: From error visibility to structural similarity","volume":"13","author":"Wang","year":"2004","journal-title":"IEEE Trans. Image Process."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1109\/TIP.2010.2046811","article-title":"Generalized assorted pixel camera: Postcapture control of resolution, dynamic range, and spectrum","volume":"19","author":"Yasuma","year":"2010","journal-title":"IEEE Trans. Image Process."},{"key":"ref_58","unstructured":"Wald, L. (2002). Data Fusion: Definitions and Architectures: Fusion of Images of Different Spatial Resolutions, Presses des MINES."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"189481","DOI":"10.1155\/2014\/189481","article-title":"Video traffic characteristics of modern encoding standards: H. 264\/AVC with SVC and MVC extensions and H. 265\/HEVC","volume":"2014","author":"Seeling","year":"2014","journal-title":"Sci. World J."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"6869","DOI":"10.1109\/TGRS.2020.3024623","article-title":"Hyperspectral image restoration: Where does the low-rank property exist","volume":"59","author":"Chang","year":"2020","journal-title":"IEEE Trans. Geosci. Remote Sens."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/2\/105\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:48:38Z","timestamp":1760104118000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/2\/105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,24]]},"references-count":60,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,2]]}},"alternative-id":["e26020105"],"URL":"https:\/\/doi.org\/10.3390\/e26020105","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,24]]}}}