{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:33:15Z","timestamp":1730230395822,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/icassp.2009.4960243","type":"proceedings-article","created":{"date-parts":[[2009,5,27]],"date-time":"2009-05-27T19:13:38Z","timestamp":1243451618000},"page":"2953-2956","source":"Crossref","is-referenced-by-count":3,"title":["Sparse Decomposition over non-full-rank dictionaries"],"prefix":"10.1109","author":[{"given":"Massoud","family":"Babaie-Zadeh","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Vigneron","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Jutten","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820031"},{"key":"ref11","article-title":"For most large underdetermined systems of linear equations the minimal $l^{1}$-norm solution is also the sparsest solution","author":"donoho","year":"2004","journal-title":"Tech Rep"},{"key":"ref12","first-page":"389","article-title":"Fast sparse representation based on smoothed 10 norm","author":"mohimani","year":"2007","journal-title":"in Proceedings of ICA'07 LNCS 4666"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2007606"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/0471249718"},{"journal-title":"Théorie et Pratique du Calcul Matriciel","year":"1995","author":"rotella","key":"ref15"},{"journal-title":"Generalized Inverse of Matrices and its Applications","year":"1971","author":"rao","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref3","first-page":"323","article-title":"A survey of sparse component analysis for blind source separation: principles, perspectives, and new challenges","author":"gribonval","year":"2006","journal-title":"in Proceedings of ESANN'06"},{"key":"ref6","first-page":"5559","article-title":"Why simple shrinkage is still relevant for redundant representations?","volume":"52","author":"elad","year":"2006","journal-title":"IEEE Transactions on Image Processing"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.814255"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/78.558475"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Maximal sparsity representation via $\\ell^{1}$ minimization","volume":"100","author":"donoho","year":"2003","journal-title":"Proc the Natl Acad Sci"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"}],"event":{"name":"ICASSP 2009 - 2009 IEEE International Conference on Acoustics, Speech and Signal Processing","start":{"date-parts":[[2009,4,19]]},"location":"Taipei, Taiwan","end":{"date-parts":[[2009,4,24]]}},"container-title":["2009 IEEE International Conference on Acoustics, Speech and Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4912736\/4959496\/04960243.pdf?arnumber=4960243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T13:57:56Z","timestamp":1640267876000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4960243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icassp.2009.4960243","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}