{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:19:27Z","timestamp":1760955567499,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/icassp.2015.7178579","type":"proceedings-article","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T18:45:43Z","timestamp":1439405143000},"page":"3287-3291","source":"Crossref","is-referenced-by-count":16,"title":["Chasing butterflies: In search of efficient dictionaries"],"prefix":"10.1109","author":[{"given":"Luc","family":"Le Magoarou","sequence":"first","affiliation":[]},{"given":"Remi","family":"Gribonval","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Sparse matrix factorization","author":"neyshabur","year":"2013","journal-title":"CoRR abs\/1311 3315"},{"key":"ref11","article-title":"Provable bounds for learning some deep representations","author":"arora","year":"2013","journal-title":"CoRR abs\/1310 6343"},{"key":"ref12","first-page":"399","article-title":"Learning fast approximations of sparse coding","author":"gregor","year":"2010","journal-title":"ICML 10 27th International Conference on Machine Learning"},{"key":"ref13","article-title":"Learning efficient sparse and low rank models","author":"pablo","year":"2012","journal-title":"CoRR abs\/1212 3631"},{"key":"ref14","first-page":"1","article-title":"Proximal Alternating Linearized Minimization for nonconvex and nonsmooth problems","author":"bolte","year":"2013","journal-title":"Mathematical Programming"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref16","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":"Signal Processing IEEE Transactions on"},{"article-title":"Efficient Implementation of the K-SVD Algorithm using Batch Orthogonal Matching Pursuit. Technical report","year":"2008","author":"rubinstein","key":"ref17"},{"key":"ref18","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref19","article-title":"Sample Complexity of Dictionary Learning and other Matrix Factorizations","author":"gribonval","year":"2013","journal-title":"ArXiv e-prints"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2036477"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2040551"},{"article-title":"Learning computationally efficient dictionaries and their implementation as fast transforms","year":"2014","author":"magoarou","key":"ref6"},{"article-title":"Toward fast transform learning. Technical report","year":"2013","author":"chabiron","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2071390"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS137"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1109\/34.192463","article-title":"A theory for multiresolution signal decomposition: the wavelet representation","volume":"11","author":"mallat","year":"1989","journal-title":"IEEE Transaction on Pattern Analysis and Machine Intelligence"},{"key":"ref9","first-page":"602","article-title":"On algorithms for sparse multi-factor NMF","author":"lyu","year":"2013","journal-title":"Advances in Neural Information Processing Systems 26"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"ref20","first-page":"3259","article-title":"The sample complexity of dictionary learning","volume":"12","author":"vainsencher","year":"2011","journal-title":"The Journal of Machine Learning Research"},{"year":"0","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2069250"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.08.005"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.04.005"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1727","DOI":"10.1137\/080734339","article-title":"A fast butterfly algorithm for the computation of Fourier integral operators","volume":"7","author":"emmanuel","year":"2009","journal-title":"Multiscale Modeling & Simulation"}],"event":{"name":"ICASSP 2015 - 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2015,4,19]]},"location":"South Brisbane, Queensland, Australia","end":{"date-parts":[[2015,4,24]]}},"container-title":["2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7158221\/7177909\/07178579.pdf?arnumber=7178579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T13:32:06Z","timestamp":1498224726000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7178579\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icassp.2015.7178579","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}