{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:56:08Z","timestamp":1761058568820},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,11,25]],"date-time":"2006-11-25T00:00:00Z","timestamp":1164412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2007,11,21]]},"DOI":"10.1007\/s10444-005-9009-5","type":"journal-article","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T17:10:18Z","timestamp":1164647418000},"page":"23-41","source":"Crossref","is-referenced-by-count":35,"title":["Beyond sparsity: Recovering structured representations by ${\\ell}^1$ minimization and greedy algorithms"],"prefix":"10.1007","volume":"28","author":[{"given":"R\u00e9mi","family":"Gribonval*","sequence":"first","affiliation":[]},{"given":"Morten","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,25]]},"reference":[{"issue":"1","key":"9009_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02678430","volume":"13","author":"G. Davis","year":"1997","unstructured":"G. Davis, S. Mallat and M. Avellaneda, Adaptive greedy approximations, Constr. Approx. 13(1) (1997) 57\u201398.","journal-title":"Constr. Approx."},{"key":"9009_CR2","doi-asserted-by":"crossref","unstructured":"G. Davis, S. Mallat and Z. Zhang, Adaptive time-frequency approximations with matching pursuits, in: Wavelets: Theory, Algorithms, and Applications (Taormina, 1993), vol. 5 of Wavelet Anal. Appl. (Academic Press, San Diego, California, 1994) pp. 271\u2013293.","DOI":"10.1016\/B978-0-08-052084-1.50018-1"},{"issue":"2","key":"9009_CR3","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1214\/aos\/1176350382","volume":"15","author":"L.K. Jones","year":"1987","unstructured":"L.K. Jones, On a conjecture of Huber concerning the convergence of projection pursuit regression, Ann. Statist. 15(2) (1987) 880\u2013882.","journal-title":"Ann. Statist."},{"issue":"7","key":"9009_CR4","doi-asserted-by":"crossref","first-page":"2845","DOI":"10.1109\/18.959265","volume":"47","author":"D.L. Donoho","year":"2001","unstructured":"D.L. Donoho and X. Huo, Uncertainty principles and ideal atomic decomposition, IEEE Trans. Inf. Theory 47(7) (2001) 2845\u20132862.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9009_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S.S. Chen","year":"1998","unstructured":"S.S. Chen, D.L. Donoho and M.A. Saunders, Atomic decomposition by basis pursuit, SIAM J. Sci. Comput. 20(1) (1998) 33\u201361 (electronic).","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"9009_CR6","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"D.L. Donoho","year":"2003","unstructured":"D.L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via $l\\sp 1$ minimization, Proc. Natl. Acad. Sci. USA 100(5) (2003) 2197\u20132202 (electronic).","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"9","key":"9009_CR7","doi-asserted-by":"crossref","first-page":"2558","DOI":"10.1109\/TIT.2002.801410","volume":"48","author":"M. Elad","year":"2002","unstructured":"M. Elad and A.M. Bruckstein, A generalized uncertainty principle and sparse representation in pairs of bases, IEEE Trans. Inf. Theory 48(9) (2002) 2558\u20132567.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"9009_CR8","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"J.A. Tropp","year":"2004","unstructured":"J.A. Tropp, Greed is good: Algorithmic results for sparse approximation, IEEE Trans. Inf. Theory 50(10) (2004) 2231\u20132242.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"9009_CR9","doi-asserted-by":"crossref","first-page":"3320","DOI":"10.1109\/TIT.2003.820031","volume":"49","author":"R. Gribonval","year":"2003","unstructured":"R. Gribonval and M. Nielsen, Sparse representations in unions of bases, IEEE Trans. Inf. Theory 49(12) (2003) 3320\u20133325.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9009_CR10","unstructured":"R. Gribonval and M. Nielsen, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Tech. Rep., Aalborg University, Aalborg, 2003."},{"key":"9009_CR11","doi-asserted-by":"crossref","unstructured":"R. Gribonval and P. Vandergheynst, On the exponential convergence of Matching Pursuits in quasi-incoherent dictionaries, IEEE Trans. Inf. Th. 52(1) 255\u2013261.","DOI":"10.1109\/TIT.2005.860474"},{"key":"9009_CR12","doi-asserted-by":"crossref","unstructured":"L. Daudet and B. Torr\u00e9sani, Hybrid representations for audiophonic signal encoding, Signal Processing, special issue on Image and Video Coding Beyond Standards 82(11) (2002) 1595\u20131617.","DOI":"10.1016\/S0165-1684(02)00304-3"},{"key":"9009_CR13","doi-asserted-by":"crossref","unstructured":"J.-F. Cardoso, Blind signal separation: Statistical principles, Proceedings of the IEEE. Special issue on blind identification and estimation 9(10) (Oct. 1998) 2009\u20132025.","DOI":"10.1109\/5.720250"},{"issue":"4","key":"9009_CR14","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1162\/089976601300014385","volume":"13","author":"M. Zibulevsky","year":"2001","unstructured":"M. Zibulevsky and B.A. Pearlmutter, Blind source separation by sparse decomposition in a signal dictionary, Neural Comput. 13(4) (2001) 863\u2013882.","journal-title":"Neural Comput."},{"key":"9009_CR15","unstructured":"J.A. Tropp, A.C. Gilbert, and M.J. Strauss, Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit,\u201d Tech. Rep, University of Michigan, Ann Arbor, 2004."},{"key":"9009_CR16","doi-asserted-by":"crossref","unstructured":"A. Jourjine, S. Rickard and O. Yilmaz, Blind separation of disjoint orthogonal signals: Demixing n sources from 2 mixtures, in: Proc. Int. Conf. Acoust. Speech Signal Process. (ICASSP\u201900), Istanbul, Turkey, June 2000, vol. 5, pp. 2985\u20132988.","DOI":"10.1109\/ICASSP.2000.861162"},{"key":"9009_CR17","doi-asserted-by":"crossref","unstructured":"R. Gribonval, Piecewise linear source separation, in: Proc. SPIE \u201903, eds. M.A. Unser, A. Aldroubi and A.F. Laine, San Diego, California, Aug. 2003, vol. 5207 Wavelets: Applications in Signal and Image Processing X, pp. 297\u2013310.","DOI":"10.1117\/12.504790"},{"key":"9009_CR18","doi-asserted-by":"crossref","unstructured":"R. Gribonval, Sparse decomposition of stereo signals with matching pursuit and application to blind separation of more than two sources from a stereo mixture, in: Proc. Int. Conf. Acoust. Speech Signal Process. (ICASSP\u201902), Orlando, Florida, USA, 2002.","DOI":"10.1109\/ICASSP.2002.5745294"},{"key":"9009_CR19","unstructured":"D. Leviatan and V.N. Temlyakov, Simultaneous approximation by greedy algorithms, Adv. Comput. Math. (to appear)."},{"issue":"7","key":"9009_CR20","doi-asserted-by":"crossref","first-page":"2477","DOI":"10.1109\/TSP.2005.849172","volume":"53","author":"K. Engan","year":"2005","unstructured":"K. Engan, S.F. Cotter, B.D. Rao and K. Kreutz-Delgado, Sparse solutions to linear inverse problems with multiple measurement vectors, IEEE Trans. Signal Process. 53(7) (2005) 2477\u20132488.","journal-title":"IEEE Trans. Signal Process."},{"issue":"2,3","key":"9009_CR21","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1018917218956","volume":"12","author":"V.N. Temlyakov","year":"2000","unstructured":"V.N. Temlyakov, Weak greedy algorithms, Adv. Comput. Math. 12(2,3) (2000) 213\u2013227.","journal-title":"Adv. Comput. Math."},{"issue":"6","key":"9009_CR22","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1109\/TIT.2003.811926","volume":"49","author":"A. Feuer","year":"2003","unstructured":"A. Feuer and A. Nemirovski, On sparse representation in pairs of bases, IEEE Trans. Inform. Theory 49(6) (2003) 1579\u20131581.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-005-9009-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-005-9009-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-005-9009-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:08:09Z","timestamp":1559149689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-005-9009-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,25]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,11,21]]}},"alternative-id":["9009"],"URL":"https:\/\/doi.org\/10.1007\/s10444-005-9009-5","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,25]]}}}