{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:14:52Z","timestamp":1766578492912},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"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,5]]},"DOI":"10.1109\/tit.2013.2238606","type":"journal-article","created":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T22:35:20Z","timestamp":1357770920000},"page":"3158-3174","source":"Crossref","is-referenced-by-count":63,"title":["Joint &lt;formula formulatype=\"inline\"&gt;&lt;tex Notation=\"TeX\"&gt;$k$&lt;\/tex&gt; &lt;\/formula&gt;-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares"],"prefix":"10.1109","volume":"59","author":[{"given":"Charles","family":"Soussen","sequence":"first","affiliation":[]},{"given":"Remi","family":"Gribonval","sequence":"additional","affiliation":[]},{"given":"Jerome","family":"Idier","sequence":"additional","affiliation":[]},{"given":"Cedric","family":"Herzet","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820031"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-005-9009-5"},{"key":"ref31","first-page":"1","article-title":"Sparse spike deconvolution with minimum scale","author":"dossal","year":"2005","journal-title":"Proc Signal Process with Adaptive Sparse Structured Representations"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173241"},{"key":"ref10","article-title":"Stability and robustness of weak orthogonal matching pursuits","author":"foucart","year":"2011","journal-title":"AMS Spring Southeastern Conf"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2044010"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173722"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.929958"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054653"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177632"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2185923"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903129"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref19","first-page":"540","volume":"22","author":"fletcher","year":"2009","journal-title":"Neural Information Processing Systems"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/8\/085009"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/00207178908953472"},{"key":"ref27","author":"dossal","year":"2005","journal-title":"Estimation de fonctions g\ufffdom\ufffdtriques et d\ufffdconvolution"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"ref6","author":"blumensath","year":"2007","journal-title":"On the difference between orthogonal matching pursuit and orthogonal least squares"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1073\/pnas.0909892106","article-title":"Message-passing algorithms for compressed sensing","volume":"106","author":"donoho","year":"2009","journal-title":"Proc Natl Acad Sci USA"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1049\/ip-vis:19990445"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035933"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2002.1001652"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimally sparse representation in general (non-orthogonal) dictionaries via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell^{1}$<\/tex> <\/formula> minimization","volume":"100","author":"donoho","year":"2003","journal-title":"Proc Natl Acad Sci USA"},{"key":"ref22","author":"donoho","year":"2004","journal-title":"Neighborly Polytopes and Sparse Solutions of Underdetermined Linear Equations"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162263"},{"key":"ref24","first-page":"1","article-title":"Greedy deconvolution of point-like objects","author":"lorenz","year":"2009","journal-title":"Proc Signal Process Adaptive Sparse Structured Representations (SPARS Workshop)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828141"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2011.5967691"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2160633"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6504538\/06408175.pdf?arnumber=6408175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T15:26:18Z","timestamp":1640273178000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6408175\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":33,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2238606","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5]]}}}