{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:36Z","timestamp":1740548076382,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159947"},{"type":"electronic","value":"9783642159954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15995-4_51","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T21:05:11Z","timestamp":1284930311000},"page":"410-417","source":"Crossref","is-referenced-by-count":1,"title":["Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach"],"prefix":"10.1007","author":[{"given":"Mehrdad","family":"Yaghoobi","sequence":"first","affiliation":[]},{"given":"Mike E.","family":"Davies","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"12","key":"51_CR1","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S. Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.: Matching Pursuits with time frequency dictionaries. IEEE Trans. on Signal Processing\u00a041(12), 3397\u20133415 (1993)","journal-title":"IEEE Trans. on Signal Processing"},{"issue":"1","key":"51_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S.S. Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic Decomposition by Basis Pursuit. SIAM Journal on Scientific Computing\u00a020(1), 33\u201361 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"12","key":"51_CR3","doi-asserted-by":"publisher","first-page":"4800","DOI":"10.1109\/TSP.2009.2026610","volume":"57","author":"M. Yaghoobi","year":"2009","unstructured":"Yaghoobi, M., Daudet, L., Davies, M.: Parametric Dictionary Design for Sparse Coding. IEEE Trans. on Signal Processing\u00a057(12), 4800\u20134810 (2009)","journal-title":"IEEE Trans. on Signal Processing"},{"issue":"23","key":"51_CR4","doi-asserted-by":"publisher","first-page":"3311","DOI":"10.1016\/S0042-6989(97)00169-7","volume":"37","author":"B.A. Olshausen","year":"1997","unstructured":"Olshausen, B.A., Field, D.J.: Sparse coding with an overcomplete basis set: a strategy employed by V1? Vision Research\u00a037(23), 3311\u20133325 (1997)","journal-title":"Vision Research"},{"issue":"2","key":"51_CR5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1162\/089976600300015826","volume":"12","author":"M.S. Lewicki","year":"2000","unstructured":"Lewicki, M.S., Sejnowski, T.J.: Learning Overcomplete Representations. Neural Comp. 12(2), 337\u2013365 (2000)","journal-title":"Neural Comp."},{"doi-asserted-by":"crossref","unstructured":"Engan, K., Aase, S.O., Hakon-Husoy, J.: Method of optimal directions for frame design. In: International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp. 2443\u20132446 (1999)","key":"51_CR6","DOI":"10.1109\/ICASSP.1999.760624"},{"issue":"11","key":"51_CR7","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M. Aharon","year":"2006","unstructured":"Aharon, M., Elad, E., Bruckstein, A.M.: K-SVD: an algorithm for designing of over complete dictionaries for sparse representation. IEEE Trans. on Signal Processing\u00a054(11), 4311\u20134322 (2006)","journal-title":"IEEE Trans. on Signal Processing"},{"issue":"6","key":"51_CR8","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1109\/TSP.2009.2016257","volume":"57","author":"M. Yaghoobi","year":"2009","unstructured":"Yaghoobi, M., Blumensath, T., Davies, M.: Dictionary Learning for Sparse Approximations with the Majorization Method. IEEE Trans. on Signal Processing\u00a057(6), 2178\u20132191 (2009)","journal-title":"IEEE Trans. on Signal Processing"},{"issue":"4","key":"51_CR9","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1109\/TNN.2005.849840","volume":"16","author":"P. Georgiev","year":"2005","unstructured":"Georgiev, P., Theis, F., Cichocki, A.: Sparse component analysis and blind source separation of underdetermined mixtures. IEEE Trans. on Neural Networks\u00a016(4), 992\u2013996 (2005)","journal-title":"IEEE Trans. on Neural Networks"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.laa.2005.06.035","volume":"416","author":"M. Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.M.: On the uniqueness of overcomplete dictionaries and a practical way to retrieve them. Journal of Linear Algebra and Applications\u00a0416, 48\u201367 (2006)","journal-title":"Journal of Linear Algebra and Applications"},{"doi-asserted-by":"crossref","unstructured":"Gribonval, R., Schnass, K.: Some Recovery Conditions for Basis Learning by L1-Minimization. In: International Symposium on Communications, Control and Signal Processing, ISCCSP (2008)","key":"51_CR11","DOI":"10.1109\/ISCCSP.2008.4537326"},{"issue":"7","key":"51_CR12","doi-asserted-by":"publisher","first-page":"3523","DOI":"10.1109\/TIT.2010.2048466","volume":"56","author":"R. Gribonval","year":"2010","unstructured":"Gribonval, R., Schnass, K.: Dictionary Identification: Sparse Matrix-Factorisation via \u21131 Minimisation. IEEE Trans. on Information Theory\u00a056(7), 3523\u20133539 (2010)","journal-title":"IEEE Trans. on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Plumbley, M.D.: Dictionary Learning for l1-Exact Sparse Coding. In: International Conference on Independent Component Analysis and Signal Separation (ICA), pp. 406\u2013413 (2007)","key":"51_CR13","DOI":"10.1007\/978-3-540-74494-8_51"},{"issue":"2","key":"51_CR14","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E. Van den Berg","year":"2008","unstructured":"Van den Berg, E., Friedlander, M.P.: Probing the Pareto frontier for basis pursuit solutions. SIAM Journal on Scientific Computing\u00a031(2), 890\u2013912 (2008)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"5","key":"51_CR15","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"A.A. Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in Hilbert space. Bulletin of the American Mathematical Society\u00a070(5), 709\u2013710 (1964)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"51_CR16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R. Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. Journal of Royal Statistical Society Series B\u00a058, 267\u2013288 (1996)","journal-title":"Journal of Royal Statistical Society Series B"}],"container-title":["Lecture Notes in Computer Science","Latent Variable Analysis and Signal Separation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15995-4_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:46:13Z","timestamp":1740523573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15995-4_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159947","9783642159954"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15995-4_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}