{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:17:52Z","timestamp":1774599472034,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"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":[[2010,7]]},"DOI":"10.1109\/tit.2010.2048466","type":"journal-article","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T15:03:57Z","timestamp":1277305437000},"page":"3523-3539","source":"Crossref","is-referenced-by-count":121,"title":["Dictionary Identification\u2014Sparse Matrix-Factorization via $\\ell_1$-Minimization"],"prefix":"10.1109","volume":"56","author":[{"given":"Remi","family":"Gribonval","sequence":"first","affiliation":[]},{"given":"Karin","family":"Schnass","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/381607a0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/78.640707"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.849840"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820031"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2006.1661411"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/089976603762552951"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9005-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2006.275587"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref28","article-title":"regularized dictionary learning for sparse approximation","author":"yaghoobi","year":"2008","journal-title":"EUSIPCO"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/2282438"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2007.09.001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.119732"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/5.720250"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1162\/089976601300014385"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02678430","volume":"13","author":"davis","year":"1997","journal-title":"Constructive Approximation"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(94)90029-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.06.035"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0437847100"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.928503"},{"key":"ref22","first-page":"67","article-title":"geometry and homotopy for <formula formulatype=\"inline\"><tex notation=\"tex\">$\\ell^1$<\/tex><\/formula> sparse signal representations","author":"plumbley","year":"2005","journal-title":"Proc 1st Workshop on Signal Processing With Sparse\/Structured Representations (SPARS'05)"},{"key":"ref21","author":"pisier","year":"1999","journal-title":"The Volume of Convex Bodies and Banach Space Geometry"},{"key":"ref24","article-title":"Compressive estimation of doubly selective channels: Exploiting channel sparsity to improve spectral efficiency in multicarrier transmissions","author":"taubck","year":"0","journal-title":"IEEE J Sel Topics Signal Process"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74494-8_51"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","article-title":"just relax: convex programming methods for subset selection and sparse approximation","volume":"51","author":"tropp","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5484964\/05484983.pdf?arnumber=5484983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:43:53Z","timestamp":1633913033000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5484983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":29,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2048466","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}