{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:43:34Z","timestamp":1729665814897,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/isspit.2011.6151554","type":"proceedings-article","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T15:20:57Z","timestamp":1329319257000},"page":"167-172","source":"Crossref","is-referenced-by-count":6,"title":["A fixed-point iterative schema for error minimization in k-sparse decomposition"],"prefix":"10.1109","author":[{"given":"Alessandro","family":"Adamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuliano","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"2443","article-title":"Method of optimal directions for frame design, Acoustics, Speech, and Signal Processing","volume":"5","author":"engan","year":"1999","journal-title":"IEEE international conference"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"journal-title":"Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit Tech Rep","year":"2006","author":"donoho","key":"ref12"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"215e","DOI":"10.1161\/01.CIR.101.23.e215","article-title":"Physiobank, physiotoolkit, and physionet: Components of a new research resource for complex physiologic signals","volume":"101","author":"goldberger","year":"2000","journal-title":"Circulation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1972-0298500-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISSPIT.2011.6151555"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860430"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450037906X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20132"},{"key":"ref9","first-page":"4311","article-title":"K-svd: An algorithm for designing overcomplete dictionaries for sparse representation","volume":"54","author":"aharon","year":"2006","journal-title":"Structure"}],"event":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","start":{"date-parts":[[2011,12,14]]},"location":"Bilbao, Spain","end":{"date-parts":[[2011,12,17]]}},"container-title":["2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6140625\/6151524\/06151554.pdf?arnumber=6151554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T14:17:16Z","timestamp":1497968236000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6151554\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isspit.2011.6151554","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}