{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:26:29Z","timestamp":1774625189325,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540230564","type":"print"},{"value":"9783540301103","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30110-3_26","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T17:13:22Z","timestamp":1284657202000},"page":"201-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Strong Uniqueness of Highly Sparse Representations from Redundant Dictionaries"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Gribonval","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,10,27]]},"reference":[{"key":"26_CR1","unstructured":"Benaroya, L., Gribonval, R., Bimbot, F.: Repr\u00e9sentations parcimonieuses pour la s\u00e9paration de sources avec un seul capteur. In: GRETSI 2001, Toulouse, France, Article _ 434 (2001)"},{"key":"26_CR2","volume-title":"Non-Linear Programming","author":"D. Bertsekas","year":"1995","unstructured":"Bertsekas, D.: Non-Linear Programming, 2nd edn. Athena Scientific, Belmont (1995)","edition":"2"},{"issue":"5","key":"26_CR3","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"D. Donoho","year":"2003","unstructured":"Donoho, D., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via _1 minimization. Proc. Nat. Aca. Sci.\u00a0100(5), 2197\u20132202 (2003)","journal-title":"Proc. Nat. Aca. Sci."},{"key":"26_CR4","unstructured":"Donoho, D., Elad, M., Temlyakov, V.: Stable recovery of sparse overcomplete representations in the presence of noise. Working draft (February 2004)"},{"issue":"7","key":"26_CR5","doi-asserted-by":"publisher","first-page":"2845","DOI":"10.1109\/18.959265","volume":"47","author":"D. Donoho","year":"2001","unstructured":"Donoho, D., Huo, X.: Uncertainty principles and ideal atomic decompositions. IEEE Trans. Inform. Theory\u00a047(7), 2845\u20132862 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"26_CR6","doi-asserted-by":"publisher","first-page":"2558","DOI":"10.1109\/TIT.2002.801410","volume":"48","author":"M. Elad","year":"2002","unstructured":"Elad, M., Bruckstein, A.: A generalized uncertainty principle and sparse representations in pairs of bases. IEEE Trans. Inform. Theory\u00a048(9), 2558\u20132567 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"26_CR7","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1109\/TIT.2003.811926","volume":"49","author":"A. Feuer","year":"2003","unstructured":"Feuer, A., Nemirovsky, A.: On sparse representations in pairs of bases. IEEE Trans. Inform. Theory\u00a049(6), 1579\u20131581 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Fuchs, J.-J.: On sparse representations in arbitrary redundant bases. Technical report, IRISA, to appear in IEEE Trans. Inform. Theory (December 2003)","DOI":"10.1109\/TIT.2004.828141"},{"key":"26_CR9","unstructured":"Gilbert, A., Muthukrishnan, S., Strauss, M.: Approximation of functions over redundant dictionaries using coherence. In: The 14th ACM-SIAM Symposium on Discrete Algorithms, SODA 2003 (January 2003)"},{"key":"26_CR10","unstructured":"Gilbert, A., Muthukrishnan, S., Strauss, M., Tropp, J.: Improved sparse approximation over quasi-incoherent dictionaries. In: Int. Conf. on Image Proc. (ICIP 2003), Barcelona, Spain (September 2003)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Gribonval, R., Nielsen, M.: Approximation with highly redundant dictionaries. In: Unser, M., Aldroubi, A., Laine, A.F. (eds.) Proc. SPIE 2003, San Diego, CA, August 2003. Wavelets: Applications in Signal and Image Processing X, vol.\u00a05207, pp. 216\u2013227 (2003)","DOI":"10.1117\/12.504776"},{"key":"26_CR12","unstructured":"Gribonval, R., Nielsen, M.: Highly sparse representations from dictionaries are unique and independent of the sparseness measure. Technical Report R-2003-16, Dept. of Math. Sciences, Aalborg University (October 2003)"},{"issue":"12","key":"26_CR13","doi-asserted-by":"publisher","first-page":"3320","DOI":"10.1109\/TIT.2003.820031","volume":"49","author":"R. Gribonval","year":"2003","unstructured":"Gribonval, R., Nielsen, M.: Sparse decompositions in unions of bases. IEEE Trans. Inform. Theory\u00a049(12), 3320\u20133325 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"26_CR14","unstructured":"Gribonval, R., Vandergheynst, P.: Exponential convergence of Matching Pursuit in quasi-incoherent dictionaries. Technical report 1619, IRISA (2004)"},{"key":"26_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Shrijver","year":"1998","unstructured":"Shrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1998)"},{"key":"26_CR16","unstructured":"Tropp, J.: Greed is good: Algorithmic results for sparse approximation. Technical report, Texas Institute for Computational Engineering and Sciences (2003)"},{"key":"26_CR17","unstructured":"Tropp, J.: Just relax: Convex programming methods for subset selection and sparse approximation. Technical Report ICES Report 04-04, UT-Austin (February 2004)"},{"issue":"4","key":"26_CR18","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1162\/089976601300014385","volume":"13","author":"M. Zibulevsky","year":"2001","unstructured":"Zibulevsky, M., Pearlmutter, B.: Blind source separation by sparse decomposition in a signal dictionary. Neural Computations\u00a013(4), 863\u2013882 (2001)","journal-title":"Neural Computations"}],"container-title":["Lecture Notes in Computer Science","Independent Component Analysis and Blind Signal Separation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30110-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T14:08:39Z","timestamp":1579788519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30110-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230564","9783540301103"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30110-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"27 October 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}