{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:07:44Z","timestamp":1774022864222,"version":"3.50.1"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"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 Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/tit.2013.2252397","type":"journal-article","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T18:38:44Z","timestamp":1366655924000},"page":"4309-4315","source":"Crossref","is-referenced-by-count":20,"title":["Compressed Data Separation With Redundant Dictionaries"],"prefix":"10.1109","volume":"59","author":[{"family":"Junhong Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Song Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Yi Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2226171"},{"key":"ref38","article-title":"Compressed sensing with coherent tight frame via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$l_{q}$<\/tex><\/formula> -minimization","author":"li","year":"0","journal-title":"Inverse Probl Imag"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820031"},{"key":"ref32","article-title":"Greedy-like algorithms for the cosparse analysis model","author":"giryes","year":"2013","journal-title":"Linear Algebra Appl"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1152\/physiol.00032.2007"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2174985"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.914346"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/100810447"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006382"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/080725891"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2010.07.024"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2005.03.005"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","article-title":"Sparsest solutions of underdetermined linear systems via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$l_{q}$<\/tex> <\/formula> minimization for <formula formulatype=\"inline\"><tex Notation=\"TeX\">$0 &#60; q \\leq 1$<\/tex><\/formula>","volume":"26","author":"foucart","year":"2009","journal-title":"Appl Comput Harmon Anal"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2013003"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283720"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimally sparse representation in general (nonorthogonal) dictionaries via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$l_{1}$<\/tex> <\/formula> minimization","volume":"100","author":"donoho","year":"2003","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860430"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0149053"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21418"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/23\/3\/007"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511730344"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191612"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000001523"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054730"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048506"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"3388","DOI":"10.1109\/TIT.2009.2021377","article-title":"On recovery of sparse signals via <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$l_{1}$<\/tex><\/formula> minimization","volume":"55","author":"cai","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"ref17","article-title":"Sharp RIP bound for sparse signal and low-rank matrix recovery","author":"cai","year":"2012","journal-title":"Appl Comput Harmon Anal"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","article-title":"For most large underdetermined systems of linear equations the minimal <formula formulatype=\"inline\"><tex Notation=\"TeX\">$l^{1}$<\/tex><\/formula> solution is also the sparsest solution","volume":"59","author":"donoho","year":"2006","journal-title":"Commun Pure Appl Math"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/060657704"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS620"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.10.002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450037906X"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2179701"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/090753504"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20227"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920190"},{"key":"ref48","doi-asserted-by":"crossref","DOI":"10.1117\/12.826663","article-title":"Signal restoration with overcomplete wavelet transforms: Comparison of analysis and synthesis priors","author":"selesnick","year":"2009","journal-title":"Proc SPIE"},{"key":"ref47","article-title":"Stable restoration and separation of approximately sparse signals, Manuscript","author":"studer","year":"0"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.04.005"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/12\/125007"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.03.006"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9005-8"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6530620\/06506948.pdf?arnumber=6506948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:45Z","timestamp":1638218865000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6506948\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":51,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2252397","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}