{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:40:31Z","timestamp":1772206831989,"version":"3.50.1"},"reference-count":77,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-CCF-1117545"],"award-info":[{"award-number":["NSF-CCF-1117545"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-CCF-1422995"],"award-info":[{"award-number":["NSF-CCF-1422995"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-EECS-1443936"],"award-info":[{"award-number":["NSF-EECS-1443936"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tsp.2018.2889951","type":"journal-article","created":{"date-parts":[[2019,1,15]],"date-time":"2019-01-15T20:01:21Z","timestamp":1547582481000},"page":"1322-1337","source":"Crossref","is-referenced-by-count":51,"title":["Sparse Signal Recovery via Generalized Entropy Functions Minimization"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2587-8501","authenticated-orcid":false,"given":"Shuai","family":"Huang","sequence":"first","affiliation":[]},{"given":"Trac D.","family":"Tran","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","article-title":"Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix","author":"lin","year":"2009","journal-title":"Urbana Univ Illinois"},{"key":"ref72","article-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2009","journal-title":"Urbana Univ Illinois"},{"key":"ref71","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.881969"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/83.661182"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"},{"key":"ref33","first-page":"1","article-title":"Sparsity-based criteria for entropy measures","author":"pastor","year":"0","journal-title":"Proc Int Symp Wireless Commun Syst"},{"key":"ref32","first-page":"2420","article-title":"Recovery of sparse probability measures via convex programming","volume":"25","author":"pilanci","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/24\/3\/035020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042413"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2013.09.010"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.808076"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1227989"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05796-4_12"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/462"},{"key":"ref61","first-page":"1145","article-title":"Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization","volume":"29","author":"reddi","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.808076"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.898300"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/78.558475"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2259813"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970104"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.09.001"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2170977"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.03.006"},{"key":"ref69","first-page":"464","author":"setzer","year":"2009","journal-title":"Split Bregman Algorithm Douglas-Rachford Splitting and Frame Shrinkage"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.4171\/022-3\/69"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2027527"},{"key":"ref22","article-title":"A general approach to sparse basis selection: Majorization, concavity, and affine scaling","author":"kreutz-delgado","year":"1997","journal-title":"Univ California—San Diego"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2016.7533084"},{"key":"ref24","author":"wickerhauser","year":"1994","journal-title":"Adapted Wavelet Analysis from Theory to Software"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.119732"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-052084-1.50017-X"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/78.738251"},{"key":"ref50","first-page":"154","article-title":"Brève communication. Régularisation d’inéquations variationnelles par approximations successives","volume":"4","author":"martinet","year":"1970","journal-title":"ESAIM Math Model Numer Anal"},{"key":"ref51","first-page":"123","article-title":"Proximal algorithms","volume":"1","author":"parikh","year":"2013","journal-title":"Found Trends Optim"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2044470"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref57","article-title":"Shannon entropy, Rényi entropy, and information","author":"bromiley","year":"2004","journal-title":"Univ Manchester Manchester U K Tech Rep Tina Memo"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-016-1329-5"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055890"},{"key":"ref54","first-page":"547","article-title":"On measures of information and entropy","volume":"1","author":"r\u00e9nyi","year":"0","journal-title":"Proc 4th Berkeley Symp Math Statist Probab"},{"key":"ref53","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref52","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","volume":"28","author":"li","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.814255"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146090"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016006"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042411"},{"key":"ref18","article-title":"Recovering jointly sparse vectors via hard thresholding pursuit","author":"foucart","year":"2011","journal-title":"Proc Sampling Theory Appl"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2254172"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2262292"},{"key":"ref9","article-title":"Adaptive nonlinear approximations","author":"davis","year":"1994","journal-title":"Dept Math New York Univ"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/090756855"},{"key":"ref45","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate $o(1\/k^2)$","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Math Doklady"},{"key":"ref48","article-title":"A review of fast l1-minimization algorithms for robust face recognition","author":"yang","year":"2010","journal-title":"arXiv 1007 3753"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/090777761"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.909319"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2028250"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/78\/8611004\/8590738-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8611004\/08590738.pdf?arnumber=8590738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:08:33Z","timestamp":1657746513000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8590738\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":77,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2018.2889951","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}