{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T03:13:05Z","timestamp":1785553985656,"version":"3.56.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/lsp.2014.2362861","type":"journal-article","created":{"date-parts":[[2014,10,28]],"date-time":"2014-10-28T19:03:15Z","timestamp":1414522995000},"page":"539-543","source":"Crossref","is-referenced-by-count":99,"title":["Euclid in a Taxicab: Sparse Blind Deconvolution with Smoothed &lt;formula formulatype=\"inline\"&gt;&lt;tex Notation=\"TeX\"&gt;${\\ell _1}\/{\\ell _2}$&lt;\/tex&gt;&lt;\/formula&gt; Regularization"],"prefix":"10.1109","volume":"22","author":[{"given":"Audrey","family":"Repetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mai Quyen","family":"Pham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"Duval","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emilie","family":"Chouzenoux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Christophe","family":"Pesquet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.864173"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2128335"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/23\/4\/008"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","article-title":"Proximit\ufffd et dualit\ufffd dans un espace hilbertien","volume":"93","author":"moreau","year":"1965","journal-title":"Bull Soc Math France"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.na.2012.09.008"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5652173"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939948"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2264464"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","author":"combettes","year":"2011","journal-title":"Fixed-Point Algorithms For Inverse Problems in Science and Engineering"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294644"},{"key":"ref40","volume":"18","year":"1996","journal-title":"Seismic Source Signature Estimation and Measurement"},{"key":"ref11","year":"2007","journal-title":"Blind Image Deconvolution Theory and Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/97.508167"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/97.586043"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1162\/089976601300014385"},{"key":"ref15","first-page":"1457","article-title":"Non-negative matrix factorization with sparseness constraints","volume":"5","author":"hoyer","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2027527"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1145\/2591796.2591886","article-title":"Rounding sum-of-squares relaxations","author":"barak","year":"2014","journal-title":"Proc Symp Theory of Computing (STOC)"},{"key":"ref18","first-page":"1328","article-title":"Approximate <formula formulatype=\"inline\"> <tex Notation=\"TeX\">${L_0}$<\/tex><\/formula> constrained non-negative matrix and tensor factorization","author":"m\ufffdrup","year":"2008","journal-title":"Proc Int Symp Circuits Syst"},{"key":"ref19","author":"gray","year":"1978","journal-title":"?Variable norm deconvolution ?"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-013-0465-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1190\/1.1444503"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/83.988963"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/78.575716"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2331614"},{"key":"ref29","author":"hiriart-urruty","year":"1993","journal-title":"Convex Analysis and Minimization Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2189999"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/79.543976"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/79.489268"},{"key":"ref2","year":"1994","journal-title":"Blind Deconvolution"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2026077"},{"key":"ref9","first-page":"1443","article-title":"A set-theoretic blind image deconvolution based on hybrid steepest descent method","volume":"e82 a","author":"kato","year":"1999","journal-title":"IEICE Trans Fund Electron Commun Comput Sci"},{"key":"ref46","first-page":"1","article-title":"A sparsity-based design of regularization parameter for adaptive proximal forward-backward splitting algorithm","author":"yukawa","year":"2013","journal-title":"Proc Int Symp Wireless Comm Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.09.006"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2296944"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638838"},{"key":"ref47","article-title":"Sparse K-means with <formula formulatype=\"inline\"> <tex Notation=\"TeX\">${\\ell _\\infty }\/{\\ell _0}$<\/tex><\/formula> Penalty for High-Dimensional Data Clustering","author":"chang","year":"2014"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1093\/imaiai\/iau007","article-title":"Scaling law for recovering the sparsest element in a subspace","author":"demanet","year":"2014","journal-title":"Inf Inference"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-2478.1986.tb00512.x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/13090540X"},{"key":"ref41","author":"ulrych","year":"2005","journal-title":"Information-Based Inversion and Processing with Applications"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995521"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2009.2025903"},{"key":"ref26","author":"chouzenoux","year":"2013","journal-title":"?A block coordinate variable metric forward-backward algorithm ?"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1190\/1.1441816"},{"key":"ref25","article-title":"Proximal alternating linearized minimization fon nonconvex and nonsmooth problems","author":"bolte","year":"2013","journal-title":"Math Progr"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/6936403\/06920070.pdf?arnumber=6920070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T20:23:13Z","timestamp":1650486193000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6920070\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":47,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2014.2362861","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5]]}}}