{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:32:17Z","timestamp":1729650737407,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/mlsp.2014.6958892","type":"proceedings-article","created":{"date-parts":[[2014,11,26]],"date-time":"2014-11-26T10:31:11Z","timestamp":1416997871000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A dictionary learning algorithm for sparse coding by the normalized bilateral projections"],"prefix":"10.1109","author":[{"given":"Taro","family":"Tezuka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283064"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511730344"},{"key":"16","first-page":"33","article-title":"GoDec: Randomized low-rank and sparse matrix decomposition in noisy case","author":"zhou","year":"2011","journal-title":"Proceedings of the 28th International Conference on Machine Learning"},{"key":"13","first-page":"3601","author":"sadeghi","year":"2014","journal-title":"Dictionary Learning for Sparse Representation A Novel Approach Proceedings of the 39th International Conference on Acoustic"},{"key":"14","first-page":"371","article-title":"Exact recovery of sparsely-used dictionaries","author":"spielman","year":"2012","journal-title":"Proceedings of the 25th Conference on Learning Theory"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2013.6661955"},{"journal-title":"Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit","year":"2008","author":"rubinstein","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2215026"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/060657704"},{"key":"1","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 Transactions on Signal Processing"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.conb.2004.07.007"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-374726-6.00015-1"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.881969"},{"journal-title":"Best Approximation in Inner Product Spaces","year":"2011","author":"deutsch","key":"4"},{"journal-title":"A Wavelet Tour of Signal Processing - The Sparse Way","year":"2009","author":"mallat","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.156"}],"event":{"name":"2014 IEEE 24th International Workshop on Machine Learning for Signal Processing (MLSP)","start":{"date-parts":[[2014,9,21]]},"location":"Reims, France","end":{"date-parts":[[2014,9,24]]}},"container-title":["2014 IEEE International Workshop on Machine Learning for Signal Processing (MLSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6945945\/6958838\/06958892.pdf?arnumber=6958892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T20:59:58Z","timestamp":1498165198000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6958892\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/mlsp.2014.6958892","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}