{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:04Z","timestamp":1740131704650,"version":"3.37.3"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1307797"],"award-info":[{"award-number":["DMS-1307797"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"AFORS","award":["FA9550-12-1-0083"],"award-info":[{"award-number":["FA9550-12-1-0083"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/tit.2016.2517011","type":"journal-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T20:50:34Z","timestamp":1452631834000},"page":"1516-1527","source":"Crossref","is-referenced-by-count":4,"title":["Dictionary Learning With Few Samples and Matrix Concentration"],"prefix":"10.1109","volume":"62","author":[{"given":"Kyle","family":"Luh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15369-3_16"},{"key":"ref11","first-page":"897","article-title":"Blind source separation with relative Newton method","author":"zibulevsky","year":"2003","journal-title":"Proc ICA"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1999.760624"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","article-title":"K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation","volume":"54","author":"aharon","year":"2006","journal-title":"IEEE Trans Signal Process"},{"key":"ref14","first-page":"3259","article-title":"The sample complexity of dictionary learning","volume":"12","author":"vainsencher","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref15","first-page":"3087","article-title":"Exact recovery of sparsely-used dictionaries","author":"spielman","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01403310"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1065725175"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74494-8_51"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495206"},{"key":"ref4","first-page":"1","article-title":"Discriminative dictionary learning with low-rank regularization for face recognition","author":"li","year":"2013","journal-title":"Proc 10th IEEE Int Conf Workshops Autom Face Gesture Recognit (FG)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539989"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1162\/089976603762552951"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref8","first-page":"165","article-title":"Blind source separation by sparse decomposition","author":"zibulevsky","year":"2000","journal-title":"Proc AeroSense"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/381607a0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1327155"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.06.035"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.2528\/PIERM08012805"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2008.01.010"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2009.04.016"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7406786\/7378964-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7406786\/07378964.pdf?arnumber=7378964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:27Z","timestamp":1649444127000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7378964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":22,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2517011","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}