{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T05:11:21Z","timestamp":1770354681009,"version":"3.49.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-StG- 2011-277906"],"award-info":[{"award-number":["ERC-StG- 2011-277906"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/jstsp.2016.2543461","type":"journal-article","created":{"date-parts":[[2016,3,17]],"date-time":"2016-03-17T18:20:31Z","timestamp":1458238831000},"page":"688-700","source":"Crossref","is-referenced-by-count":34,"title":["Flexible Multilayer Sparse Approximations of Matrices and Applications"],"prefix":"10.1109","volume":"10","author":[{"given":"Luc","family":"Le Magoarou","sequence":"first","affiliation":[]},{"given":"Remi","family":"Gribonval","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1126\/science.1127647"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1561\/2200000006"},{"key":"ref33","article-title":"Sparse matrix factorization","volume":"abs 1311 3315","author":"neyshabur","year":"2013","journal-title":"CoRR"},{"key":"ref32","first-page":"602","article-title":"On algorithms for sparse multi-factor NMF","author":"lyu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2071390"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS137"},{"key":"ref37","first-page":"153","article-title":"Greedy layer-wise training of deep networks","volume":"19","author":"bengio","year":"2007","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref36","first-page":"998","article-title":"Wavelets on graphs via deep learning","author":"rustamov","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","first-page":"1620","article-title":"Multiresolution matrix factorization","volume":"32","author":"kondor","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref34","article-title":"Provable bounds for learning some deep representations","volume":"abs 1310 6343","author":"arora","year":"2013","journal-title":"CoRR"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392779"},{"key":"ref27","first-page":"399","article-title":"Learning fast approximations of sparse coding","author":"gregor","year":"0","journal-title":"Proc 27th Annu Int Conf Mach Learn (ICML’10)"},{"key":"ref29","article-title":"k-Sparse autoencoders","volume":"abs 1312 5663","author":"makhzani","year":"2013","journal-title":"CoRR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178579"},{"key":"ref1","article-title":"Learning computationally efficient dictionaries and their implementation as fast transforms","volume":"abs 1406 5388","author":"le magoarou","year":"2014","journal-title":"CoRR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2424238"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s006070050015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(85)90002-6"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160440202"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/060671139"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/060657704"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939537"},{"key":"ref50","first-page":"3259","article-title":"The sample complexity of dictionary learning","volume":"12","author":"vainsencher","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2069250"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2008.04.246"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2040551"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2036477"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-014-0771-z"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"2516","DOI":"10.1109\/EUSIPCO.2015.7362838","article-title":"FA?ST: Speeding up linear transforms for tractable inverse problems","author":"le magoarou","year":"2015","journal-title":"Proc 23rd Eur Signal Process Conf (EUSIPCO)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref19","article-title":"SciPy: Open source scientific tools for Python","author":"jones","year":"2001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222685"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/34.192463"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093941"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321881"},{"key":"ref49","article-title":"Image Processing Place","author":"gonzalez","year":"0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref46","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref45","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":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.881969"},{"key":"ref47","first-page":"1","article-title":"Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit","volume":"40","author":"rubinstein","year":"2008","journal-title":"CS Technion"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2013.10.027"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1088\/0031-9155\/57\/7\/1937"},{"key":"ref44","first-page":"2443","volume":"5","author":"engan","year":"0","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910971"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/7469412\/07435254.pdf?arnumber=7435254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:45Z","timestamp":1642003365000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7435254\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":51,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2016.2543461","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}