{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T07:18:52Z","timestamp":1783063132285,"version":"3.54.6"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100010255","name":"Guangxi Key Laboratory of Automatic Detection Technology and Instrument Foundation","doi-asserted-by":"publisher","award":["YQ22111"],"award-info":[{"award-number":["YQ22111"]}],"id":[{"id":"10.13039\/501100010255","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018571","name":"Specific Research Project of Guangxi for Research Bases and Talents","doi-asserted-by":"publisher","award":["GuiKeAD22080028"],"award-info":[{"award-number":["GuiKeAD22080028"]}],"id":[{"id":"10.13039\/501100018571","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Guangxi Natural Science Foundation","doi-asserted-by":"publisher","award":["2026GXNSFAA00641012"],"award-info":[{"award-number":["2026GXNSFAA00641012"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Fujian Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2024J01098"],"award-info":[{"award-number":["2024J01098"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62261011"],"award-info":[{"award-number":["62261011"]}],"id":[{"id":"10.13039\/501100001809","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,10]]},"DOI":"10.1016\/j.sigpro.2026.110675","type":"journal-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:01:15Z","timestamp":1777474875000},"page":"110675","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Analysis-based \u21131\/\u21132-regularized minimization for signal recovery"],"prefix":"10.1016","volume":"247","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3244-6459","authenticated-orcid":false,"given":"Tao","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junhui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiawei","family":"Tu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.sigpro.2026.110675_bib0001","series-title":"Handbook of mathematical methods in imaging","author":"Scherzer","year":"2010"},{"issue":"4","key":"10.1016\/j.sigpro.2026.110675_bib0002","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","article-title":"Compressed sensing","volume":"52","author":"Donoho","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.sigpro.2026.110675_bib0003","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1109\/MSP.2013.2273004","article-title":"Image inpainting: overview and recent advances","volume":"31","author":"Guillemot","year":"2014","journal-title":"IEEE Signal Process. Mag."},{"key":"10.1016\/j.sigpro.2026.110675_bib0004","series-title":"Deblurring images: Matrices, spectra, and filtering","author":"Hansen","year":"2006"},{"key":"10.1016\/j.sigpro.2026.110675_bib0005","series-title":"Sparse and redundant representations\u2014From theory to applications in signal and image processing","author":"Elad","year":"2010"},{"issue":"3","key":"10.1016\/j.sigpro.2026.110675_bib0006","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1088\/0266-5611\/23\/3\/007","article-title":"Analysis versus synthesis in signal priors","volume":"23","author":"Elad","year":"2007","journal-title":"Inverse Probl."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110675_bib0007","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0097539792240406","article-title":"Sparse approximate solutions to linear systems","volume":"24","author":"Natarajan","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110675_bib0008","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","article-title":"Iterative hard thresholding for compressed sensing","volume":"27","author":"Blumensath","year":"2009","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110675_bib0009","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/S003614450037906X","article-title":"Atomic decomposition by basis pursuit","volume":"43","author":"Chen","year":"2001","journal-title":"SIAM Rev."},{"issue":"10","key":"10.1016\/j.sigpro.2026.110675_bib0010","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/LSP.2007.898300","article-title":"Exact reconstruction of sparse signals via nonconvex minimization","volume":"14","author":"Chartrand","year":"2007","journal-title":"IEEE Signal Process. Lett."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110675_bib0011","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","article-title":"Improved iteratively reweighted least squares for unconstrained smoothed \u2113q minimization","volume":"51","author":"Lai","year":"2013","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110675_bib0012","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/j.acha.2017.10.004","article-title":"Optimal RIP bounds for sparse signals recovery via \u2113p minimization","volume":"47","author":"Zhang","year":"2019","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110675_bib0013","doi-asserted-by":"crossref","first-page":"87","DOI":"10.4310\/CIS.2014.v14.n2.a2","article-title":"Ratio and difference of \u21131 and \u21132 norms and sparse representation with coherent dictionaries","volume":"14","author":"Yin","year":"2014","journal-title":"Commun. Inf. Syst."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110675_bib0014","doi-asserted-by":"crossref","DOI":"10.1007\/s10915-014-9930-1","article-title":"Computing sparse representation in a highly coherent dictionary based on difference of L1 and L2","volume":"64","author":"Lou","year":"2015","journal-title":"J. Sci. Comput."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110675_bib0015","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1137\/20M136517X","article-title":"New restricted isometry property analysis for \u21131\u2212\u21132 minimization methods","volume":"14","author":"Ge","year":"2021","journal-title":"SIAM J. Imaging Sci."},{"key":"10.1016\/j.sigpro.2026.110675_bib0016","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/LSP.2022.3158839","article-title":"An improved sufficient condition for sparse signal recovery with minimization of L1\u2212L2","volume":"29","author":"He","year":"2022","journal-title":"IEEE Signal Process. Lett."},{"key":"10.1016\/j.sigpro.2026.110675_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2022.108755","article-title":"Signal and image reconstruction with tight frames via unconstrained \u21131\u2212\u03b1\u21132-analysis minimizations","volume":"203","author":"Li","year":"2023","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110675_bib0018","doi-asserted-by":"crossref","first-page":"2787","DOI":"10.1109\/TSP.2025.3582921","article-title":"New restricted isometry property analysis for \u21131\u2212\u03b1\u21132 minimization","volume":"73","author":"Li","year":"2025","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110675_bib0019","series-title":"Proceedings of the Advances Neural Information Processing Systems","first-page":"1929\u20141936","article-title":"Multi-stage convex relaxation for learning with sparse regularization","author":"Zhang","year":"2009"},{"issue":"497","key":"10.1016\/j.sigpro.2026.110675_bib0020","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1080\/01621459.2011.645783","article-title":"Likelihood-based selection and sharp parameter estimation","volume":"107","author":"Shen","year":"2012","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110675_bib0021","doi-asserted-by":"crossref","first-page":"511","DOI":"10.4310\/CMS.2017.v15.n2.a9","article-title":"Minimization of transformed L1 penalty: closed form representation and iterative thresholding algorithms","volume":"15","author":"Zhang","year":"2017","journal-title":"Commun. Math. Sci."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110675_bib0022","doi-asserted-by":"crossref","DOI":"10.1007\/s10107-018-1236-x","article-title":"Minimization of transformed L1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing","volume":"169","author":"Zhang","year":"2018","journal-title":"Math. Program."},{"issue":"10","key":"10.1016\/j.sigpro.2026.110675_bib0023","doi-asserted-by":"crossref","first-page":"4723","DOI":"10.1109\/TIT.2009.2027527","article-title":"Comparing measures of sparsity","volume":"55","author":"Hurley","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"10.1016\/j.sigpro.2026.110675_bib0024","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1109\/LSP.2014.2362861","article-title":"Euclid in a taxicab: sparse blind deconvolution with smoothed \u21131\/\u21132 regularization","volume":"22","author":"Repetti","year":"2015","journal-title":"IEEE Signal Process. Lett."},{"key":"10.1016\/j.sigpro.2026.110675_bib0025","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.sigpro.2016.12.022","article-title":"A noise-robust method with smoothed \u21131\/\u21132 regularization for sparse moving-source mapping","volume":"135","author":"Pham","year":"2017","journal-title":"Signal Process."},{"issue":"6","key":"10.1016\/j.sigpro.2026.110675_bib0026","doi-asserted-by":"crossref","first-page":"A3649","DOI":"10.1137\/18M123147X","article-title":"A scale-invariant approach for sparse signal recovery","volume":"41","author":"Rahimi","year":"2019","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110675_bib0027","doi-asserted-by":"crossref","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 textregistered Mach. Learn."},{"key":"10.1016\/j.sigpro.2026.110675_bib0028","doi-asserted-by":"crossref","first-page":"2660","DOI":"10.1109\/TSP.2020.2985298","article-title":"Accelerated schemes for the L1\/L2 minimization","volume":"68","author":"Wang","year":"2020","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110675_bib0029","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","article-title":"A DC optimization algorithm for solving the trust-region subproblem","volume":"8","author":"Tao","year":"1998","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110675_bib0030","doi-asserted-by":"crossref","first-page":"A770","DOI":"10.1137\/20M136801X","article-title":"Minimization of L1 over L2 for sparse signal recovery with convergence guarantee","volume":"44","author":"Tao","year":"2022","journal-title":"SIAM J. Sci. Comput."},{"issue":"94","key":"10.1016\/j.sigpro.2026.110675_bib0031","article-title":"Study on L1 over L2 minimization for nonnegative signal recovery","volume":"95","author":"Tao","year":"2024","journal-title":"J. Sci. Comput."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110675_bib0032","doi-asserted-by":"crossref","first-page":"1576","DOI":"10.1137\/20M1355380","article-title":"Analysis and algorithms for some compressed sensing models based on L1\/L2 minimization","volume":"31","author":"Zeng","year":"2021","journal-title":"SIAM J. Optim."},{"issue":"6","key":"10.1016\/j.sigpro.2026.110675_bib0033","doi-asserted-by":"crossref","first-page":"3232","DOI":"10.1137\/090763317","article-title":"A moving balls approximation method for a class of smooth constrained minimization problems","volume":"20","author":"Auslender","year":"2010","journal-title":"SIAM J. Optim."},{"issue":"32","key":"10.1016\/j.sigpro.2026.110675_bib0034","article-title":"Sorted L1\/L2 minimization for sparse signal recovery","volume":"99","author":"Wang","year":"2024","journal-title":"J. Sci. Comput."},{"key":"10.1016\/j.sigpro.2026.110675_bib0035","doi-asserted-by":"crossref","first-page":"2874","DOI":"10.1109\/TSP.2024.3404250","article-title":"On partial smoothness, activity identification and faster algorithms of L1 over L2 minimization","volume":"72","author":"Tao","year":"2024","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110675_bib0036","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S1052623401387623","article-title":"Active sets, nonsmoothness and sensitivity","volume":"13","author":"Lewis","year":"2002","journal-title":"SIAM J. Optim."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110675_bib0037","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1090\/S0002-9947-96-01544-9","article-title":"Prox-regular functions in variational analysis","volume":"348","author":"Poliquin","year":"1996","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110675_bib0038","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1137\/20M1341490","article-title":"Limited-angle CT reconstruction via the L1\/L2 minimization","volume":"14","author":"Wang","year":"2021","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110675_bib0039","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.acha.2010.10.002","article-title":"Compressed sensing with coherent and redundant dictionaries","volume":"31","author":"Cand\u00e8s","year":"2011","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110675_bib0040","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.acha.2012.03.006","article-title":"The cosparse analysis model and algorithms","volume":"34","author":"Nam","year":"2013","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110675_bib0041","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/18.382009","article-title":"De-noising by soft-thresholding","volume":"41","author":"Donoho","year":"1995","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.sigpro.2026.110675_bib0042","series-title":"Numerical optimization","author":"Nocedal","year":"2006"},{"key":"10.1016\/j.sigpro.2026.110675_bib0043","first-page":"205","article-title":"Information geometry and alternating minimization procedures","volume":"1","author":"Csisz\u00e1r","year":"1984","journal-title":"Stat. Decis."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110675_bib0044","first-page":"123","article-title":"Proximal algorithms","volume":"1","author":"Parikh","year":"2014","journal-title":"Found. Trends textregistered Optim."},{"key":"10.1016\/j.sigpro.2026.110675_bib0045","series-title":"Basic real analysis","author":"Sohrab","year":"2014"},{"key":"10.1016\/j.sigpro.2026.110675_bib0046","unstructured":"M. Tao, X. Zhang, Y. Zhao, On NP-Hardness of \u21131\/\u21132 minimization and bound theory of nonzero entries in solutions, 2024, arXiv: 2409.18748."},{"issue":"12","key":"10.1016\/j.sigpro.2026.110675_bib0047","doi-asserted-by":"crossref","first-page":"6063","DOI":"10.1109\/TIP.2019.2924173","article-title":"Unified single-image and video super-resolution via denoising algorithms","volume":"28","author":"Brifman","year":"2019","journal-title":"IEEE Trans. Image Process."},{"issue":"7","key":"10.1016\/j.sigpro.2026.110675_bib0048","doi-asserted-by":"crossref","first-page":"3150","DOI":"10.1109\/TSP.2008.917874","article-title":"Low-complexity RLS algorithms using dichotomous coordinate descent iterations","volume":"56","author":"Zakharov","year":"2008","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110675_bib0049","series-title":"Matrix Computations (Fourth Edition)","author":"Golub","year":"2013"},{"issue":"3","key":"10.1016\/j.sigpro.2026.110675_bib0050","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/biomet\/81.3.425","article-title":"Ideal Spatial Adaptation by Wavelet Shrinkage","volume":"81","author":"Donoho","year":"1994","journal-title":"Biometrika"},{"issue":"7","key":"10.1016\/j.sigpro.2026.110675_bib0051","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1109\/TSP.2014.2304932","article-title":"Smoothing and decomposition for analysis sparse recovery","volume":"62","author":"Tan","year":"2014","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110675_bib0052","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s10898-022-01126-2","article-title":"Sparse signal recovery via generalized gaussian function","volume":"83","author":"Li","year":"2022","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.sigpro.2026.110675_bib0053","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1109\/TSP.2023.3262184","article-title":"Iterative difference hard-thresholding algorithm for sparse signal recovery","volume":"71","author":"Cui","year":"2023","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110675_bib0054","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109617","article-title":"Non-signal components minimization for sparse signal recovery","volume":"226","author":"Xiang","year":"2025","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110675_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2023.109104","article-title":"The variant of the iterative shrinkage-thresholding algorithm for minimization of the \u21131 over \u2113\u221e norms","volume":"211","author":"Wang","year":"2023","journal-title":"Signal Process."},{"issue":"12","key":"10.1016\/j.sigpro.2026.110675_bib0056","doi-asserted-by":"crossref","first-page":"2091","DOI":"10.1109\/TIP.2005.859376","article-title":"The contourlet transform: an efficient directional multiresolution image representation","volume":"14","author":"Do","year":"2005","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110675_bib0057","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."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110675_bib0058","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TSP.2011.2170977","article-title":"Fast and efficient compressive sensing using structurally random matrices","volume":"60","author":"Do","year":"2012","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426001891?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426001891?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:50:28Z","timestamp":1783061428000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168426001891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":58,"alternative-id":["S0165168426001891"],"URL":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110675","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Analysis-based \u21131\/\u21132-regularized minimization for signal recovery","name":"articletitle","label":"Article Title"},{"value":"Signal Processing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110675","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":"110675"}}