{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T14:31:35Z","timestamp":1790346695620,"version":"4.1.0"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100013798","name":"Jiangxi Science and Technology Normal University","doi-asserted-by":"publisher","award":["2023BSQD25"],"award-info":[{"award-number":["2023BSQD25"]}],"id":[{"id":"10.13039\/501100013798","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12401496"],"award-info":[{"award-number":["12401496"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["20242BAB20006 20244BCE52256"],"award-info":[{"award-number":["20242BAB20006 20244BCE52256"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.sigpro.2026.110722","type":"journal-article","created":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T02:24:41Z","timestamp":1779675881000},"page":"110722","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A tensor equation-free method for TV-regularized tensor completion with sparsity-inducing low-rankness"],"prefix":"10.1016","volume":"248","author":[{"given":"Ming","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7629-9897","authenticated-orcid":false,"given":"Xiao-Qin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fu-Zheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xu-Yun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4990-9487","authenticated-orcid":false,"given":"Huan","family":"Ren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.sigpro.2026.110722_bib0001","doi-asserted-by":"crossref","first-page":"3473","DOI":"10.1109\/TSP.2021.3086363","article-title":"A novel regularized model for third-order tensor completion","volume":"69","author":"Yang","year":"2021","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110722_bib0002","series-title":"Proceedings IEEE International Conference on Image Processing","first-page":"517","article-title":"Tensor completion for on-board compression of hyperspectral images","author":"Li","year":"2010"},{"key":"10.1016\/j.sigpro.2026.110722_bib0003","doi-asserted-by":"crossref","first-page":"14603","DOI":"10.1109\/TNNLS.2023.3280086","article-title":"Robust low-tubal-rank tensor completion based on tensor factorization and maximum correntropy criterion","volume":"35","author":"He","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.sigpro.2026.110722_bib0004","doi-asserted-by":"crossref","first-page":"2152","DOI":"10.1109\/TSP.2022.3164837","article-title":"Grassmannian optimization for online tensor completion and tracking with the t-SVD","volume":"70","author":"Gilman","year":"2022","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110722_bib0005","doi-asserted-by":"crossref","first-page":"3305","DOI":"10.1109\/TNNLS.2021.3051650","article-title":"Generalized nonconvex approach for low-tubal-rank tensor recovery","volume":"33","author":"Wang","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.sigpro.2026.110722_bib0006","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":"10.1016\/j.sigpro.2026.110722_bib0007","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/110837711","article-title":"Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging","volume":"34","author":"Kilmer","year":"2013","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.sigpro.2026.110722_bib0008","series-title":"Proceedings 27th IEEE Conference on Computer Vision and Pattern Recognition","first-page":"3842","article-title":"Novel methods for multilinear data completion and de-noising based on tensor-SVD","author":"Zhang","year":"2014"},{"key":"10.1016\/j.sigpro.2026.110722_bib0009","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":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"10.1016\/j.sigpro.2026.110722_bib0010","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1109\/TSP.2016.2639466","article-title":"Exact tensor completion using t-SVD","volume":"65","author":"Zhang","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110722_bib0011","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/TCSVT.2019.2908833","article-title":"Robust PCA using generalized nonconvex regularization","volume":"30","author":"Wen","year":"2020","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"10.1016\/j.sigpro.2026.110722_bib0012","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1109\/JSTSP.2018.2879185","article-title":"t-Schatten-p norm for low-rank tensor recovery","volume":"12","author":"Kong","year":"2018","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110722_bib0013","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.3934\/ipi.2025011","article-title":"The non-convex tensor completion via the weighted Laplace function for 3D array image data","volume":"19","author":"Zeng","year":"2025","journal-title":"Inverse Probl. Imaging"},{"key":"10.1016\/j.sigpro.2026.110722_bib0014","doi-asserted-by":"crossref","first-page":"4291","DOI":"10.1109\/TSP.2022.3201330","article-title":"3-D array image data completion by tensor decomposition and nonconvex regularization approach","volume":"70","author":"Yang","year":"2022","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110722_bib0015","series-title":"Proceedings 29th AAAI Conference on Artificial Intelligence","first-page":"1805","article-title":"Generalized singular value thresholding","author":"Lu","year":"2015"},{"key":"10.1016\/j.sigpro.2026.110722_bib0016","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10915-022-02005-4","article-title":"A new tensor multi-rank approximation with total variation regularization for tensor completion","volume":"93","author":"Duan","year":"2022","journal-title":"J. Sci. Comput."},{"key":"10.1016\/j.sigpro.2026.110722_bib0017","series-title":"Proceedings 44th IEEE International Conference on Acoustics, Speech and Signal Processing","first-page":"8603","article-title":"Total-variation-regularized tensor ring completion for remote sensing image reconstruction","author":"He","year":"2015"},{"key":"10.1016\/j.sigpro.2026.110722_bib0018","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.ins.2015.07.049","article-title":"Tensor completion using total variation and low-rank matrix factorization","volume":"326","author":"Ji","year":"2016","journal-title":"Inf. Sci."},{"key":"10.1016\/j.sigpro.2026.110722_bib0019","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11075-020-00876-y","article-title":"Adaptive total variation and second-order total variation-based model for low-rank tensor completion","volume":"86","author":"Li","year":"2021","journal-title":"Numer. Algorithms"},{"key":"10.1016\/j.sigpro.2026.110722_bib0020","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1007\/s10851-019-00933-9","article-title":"Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data","volume":"62","author":"Lin","year":"2020","journal-title":"J. Math. Imaging Vis."},{"key":"10.1016\/j.sigpro.2026.110722_bib0021","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.image.2018.11.008","article-title":"A total variation and group sparsity based tensor optimization model for video rain streak removal","volume":"73","author":"Wang","year":"2019","journal-title":"Signal Process. Image Commun."},{"key":"10.1016\/j.sigpro.2026.110722_bib0022","doi-asserted-by":"crossref","DOI":"10.1137\/130915406","article-title":"Total variation structured total least squares method for image restoration","volume":"35","author":"Zhao","year":"2013","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.sigpro.2026.110722_bib0023","doi-asserted-by":"crossref","first-page":"7861","DOI":"10.1109\/TIP.2020.3008367","article-title":"Truncated low-rank and total p variation constrained color image completion and its Moreau approximation algorithm","volume":"29","author":"Zheng","year":"2020","journal-title":"IEEE Trans. Image Process."},{"key":"10.1016\/j.sigpro.2026.110722_bib0024","series-title":"Proceedings IEEE International Conference on Acoustics, Speech and Signal Processing","first-page":"1363","article-title":"Anisotropic total variation regularized low-rank tensor completion based on tensor nuclear norm for color image inpainting","author":"Jiang","year":"2018"},{"key":"10.1016\/j.sigpro.2026.110722_bib0025","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.neucom.2020.12.110","article-title":"Robust low-rank tensor completion via transformed tensor nuclear norm with total variation regularization","volume":"435","author":"Qiu","year":"2021","journal-title":"Neurocomputing"},{"key":"10.1016\/j.sigpro.2026.110722_bib0026","doi-asserted-by":"crossref","first-page":"10990","DOI":"10.1109\/TPAMI.2023.3259640","article-title":"Guaranteed tensor recovery fused low-rankness and smoothness","volume":"45","author":"Wang","year":"2023","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.sigpro.2026.110722_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2024.129266","article-title":"Low-rank high-order tensor recovery via joint transformed tensor nuclear norm and total variation regularization","volume":"624","author":"Luo","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.sigpro.2026.110722_bib0028","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/080724265","article-title":"A new alternating minimization algorithm for total variation image reconstruction","volume":"1","author":"Wang","year":"2008","journal-title":"SIAM J. Imaging Sci."},{"key":"10.1016\/j.sigpro.2026.110722_bib0029","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109666","article-title":"Robust low-rank matrix completion via sparsity-inducing regularizer","volume":"226","author":"Wang","year":"2025","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110722_bib0030","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/TPAMI.2019.2891760","article-title":"Tensor robust principal component analysis with a new tensor nuclear norm","volume":"42","author":"Lu","year":"2020","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.sigpro.2026.110722_bib0031","series-title":"First-Order Methods in Optimization","author":"Beck","year":"2017"},{"key":"10.1016\/j.sigpro.2026.110722_bib0032","series-title":"Envelope Theorem","author":"Wainwright","year":"2004"},{"key":"10.1016\/j.sigpro.2026.110722_bib0033","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10915-021-01679-6","article-title":"The nonconvex tensor robust principal component analysis approximation model via the weighted \u2113p-norm regularization","volume":"89","author":"Li","year":"2021","journal-title":"J. Sci. Comput."},{"key":"10.1016\/j.sigpro.2026.110722_bib0034","series-title":"Mathematics for Machine Learning","author":"Deisenroth","year":"2020"},{"key":"10.1016\/j.sigpro.2026.110722_bib0035","series-title":"Proceedings 31st AAAI Conference on Artificial Intelligence","first-page":"2210","article-title":"Low-rank tensor completion with total variation for visual data inpainting","author":"Li","year":"2017"},{"key":"10.1016\/j.sigpro.2026.110722_bib0036","doi-asserted-by":"crossref","first-page":"3519","DOI":"10.1109\/TSP.2024.3424272","article-title":"Low-rank tensor completion via novel sparsity-inducing regularizers","volume":"72","author":"Wang","year":"2024","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110722_bib0037","article-title":"Tensor completion via Tucker decomposition with correlated total variation regularization on factor matrices","volume":"238","author":"Wang","year":"2025","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110722_bib0038","series-title":"Proceedings 8th IEEE International Conference on Computer Vision","first-page":"416","article-title":"A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics","author":"Martin","year":"2001"},{"key":"10.1016\/j.sigpro.2026.110722_bib0039","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2019.124699","article-title":"A modified CG algorithm for solving generalized coupled Sylvester tensor equations","volume":"365","author":"Lv","year":"2020","journal-title":"Appl. Math. Comput."}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426002367?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426002367?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T01:48:07Z","timestamp":1783043287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168426002367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":39,"alternative-id":["S0165168426002367"],"URL":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110722","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A tensor equation-free method for TV-regularized tensor completion with sparsity-inducing low-rankness","name":"articletitle","label":"Article Title"},{"value":"Signal Processing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110722","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"110722"}}