{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:17:32Z","timestamp":1649042252479},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1109\/tit.2013.2287496","type":"journal-article","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T18:48:42Z","timestamp":1384886922000},"page":"133-149","source":"Crossref","is-referenced-by-count":11,"title":["On the Fundamental Limits of Recovering Tree Sparse Vectors From Noisy Linear Measurements"],"prefix":"10.1109","volume":"60","author":[{"given":"Akshay","family":"Soni","sequence":"first","affiliation":[]},{"given":"Jarvis","family":"Haupt","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"genovese","year":"2009","journal-title":"Revisiting Marginal Regression"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390271"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.1910320609"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2191780"},{"key":"ref30","first-page":"59140w-1","article-title":"Signal reconstruction using sparse tree representation","volume":"5914","author":"la","year":"2005","journal-title":"Proc SPIE"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"2183","DOI":"10.1109\/TIT.2009.2016018","article-title":"Sharp thresholds for high-dimensional and noisy sparsity recovery using <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell_{1}$<\/tex> <\/formula>-constrained quadratic programming (Lasso)","volume":"55","author":"wainwright","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059891"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/110820579"},{"key":"ref34","article-title":"Adaptive compressed image sensing based on wavelet modeling and direct sampling","author":"deutsch","year":"2009","journal-title":"8th Int Conf Sampling Theory Appl"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/83.931100"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/78.668544"},{"key":"ref29","article-title":"Fast reconstruction of piecewise smooth signals from incoherent projections","author":"duarte","year":"2005","journal-title":"SPARS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.914345"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000001523"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553429"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2020754"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040894"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190216"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2161982"},{"key":"ref26","author":"mallat","year":"2008","journal-title":"A Wavelet Tour of Signal Processing The Sparse Way"},{"key":"ref25","article-title":"Adaptive sensing with structured sparsity","author":"rao","year":"2013","journal-title":"IEEE Acoust Speech Signal Process"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS776"},{"key":"ref51","author":"obozinski","year":"2011","journal-title":"Group Lasso with Overlaps The Latent Group Lasso Approach"},{"key":"ref58","author":"knuth","year":"1972","journal-title":"Art of Computer Programming Volume 1 Fundamental Algorithms"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.08.010"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/DSP.2009.4786013"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2012.6489376"},{"key":"ref54","first-page":"2297","article-title":"Proximal methods for hierarchical sparse coding","volume":"12","author":"jenatton","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOS584"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283595"},{"key":"ref10","author":"malloy","year":"2012","journal-title":"Sequential testing for sparse recovery"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032726"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2215837"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2012.6319715"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2256105"},{"key":"ref14","author":"balakrishnan","year":"2012","journal-title":"Recovering block-structured activations using compressive measurements"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2013.6810388"},{"key":"ref16","author":"castro","year":"2012","journal-title":"Adaptive sensing performance lower bounds for sparse signal detection and support estimation"},{"key":"ref17","author":"haupt","year":"2011","journal-title":"Compressed Sensing Theory and Applications"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.83"},{"key":"ref19","author":"price","year":"2012","journal-title":"Lower Bounds for Adaptive Sparse Recovery"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.929114"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518814"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2009.5470138"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162269"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2112353"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495941"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2187201"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOS526"},{"key":"ref45","doi-asserted-by":"crossref","DOI":"10.1007\/b13794","author":"tsybakov","year":"2009","journal-title":"Introduction to Nonparametric Estimation"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.09.003"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1214\/08-AOS653","article-title":"Near-ideal model selection by <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$\\ell_{1}$<\/tex><\/formula> minimization","volume":"37","author":"cand\ufffds","year":"2009","journal-title":"Ann Statist"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034054"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046199"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253852"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184848"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6690264\/06648675.pdf?arnumber=6648675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:54Z","timestamp":1638218874000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6648675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":58,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2287496","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}