{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:09:13Z","timestamp":1730225353261,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/i2mtc.2019.8827147","type":"proceedings-article","created":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T21:14:51Z","timestamp":1568063691000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Boost Algorithm Exploiting Adjacent Sparsity Pattern"],"prefix":"10.1109","author":[{"given":"Jingchao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liyan","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042414"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6855177"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2017.2665983"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2794779"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref15","first-page":"572","article-title":"Algorithms forsimultaneous sparse approximation. Part I: Greedy pursuit","volume":"86","author":"troop","year":"2006","journal-title":"SignalProcessing"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2012.2203729"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2013.2251821"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MIM.2012.6145261"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2015.2469415"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2018.11.015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSSC.2015.2442394"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMTT.2017.2772883"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2011.941094"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MIM.2017.7864545"}],"event":{"name":"2019 IEEE International Instrumentation and Measurement Technology Conference (I2MTC)","start":{"date-parts":[[2019,5,20]]},"location":"Auckland, New Zealand","end":{"date-parts":[[2019,5,23]]}},"container-title":["2019 IEEE International Instrumentation and Measurement Technology Conference (I2MTC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8822388\/8826808\/08827147.pdf?arnumber=8827147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:19:36Z","timestamp":1658247576000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8827147\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/i2mtc.2019.8827147","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}