{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:52:12Z","timestamp":1730274732231,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620348","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"859-863","source":"Crossref","is-referenced-by-count":1,"title":["Relation between exact and robust recovery for F-minimization: A topological viewpoint"],"prefix":"10.1109","author":[{"given":"Jingbo","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuantao","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Topics in Sparse Approximation Ph d Dissertation","year":"2004","author":"tropp","key":"15"},{"journal-title":"Robustness of Sparse Recovery Via F-minimization A Topological Viewpoint","year":"2012","author":"liu","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820031"},{"journal-title":"Differential Topology Lecture Notes","year":"1958","author":"milnor","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2006.09.003"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"journal-title":"Notes on Compressed Sensing","year":"2009","author":"foucart","key":"10"},{"key":"7","first-page":"35","article-title":"Iteratively re-weighted least squares minimization for sparse recovery","volume":"63","author":"daubechies","year":"0","journal-title":"Princeton Univ NJ Program in Applied and Computational Mathematics"},{"key":"6","article-title":"Recovering sparse signals with non-convex penalties and dc programming","volume":"57","author":"gasso","year":"0","journal-title":"IEEE Trans Signal Processing"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2009.2039173"},{"key":"4","first-page":"6","article-title":"On the stable recovery of the sparsest overcomplete representations in presence of noise","volume":"52","author":"zadeh","year":"2010","journal-title":"IEEE Trans Inf Theory"},{"key":"9","article-title":"Stability and robustness of lq minimization using null space property","author":"aldroubi","year":"2011","journal-title":"Proceedings of SAMPTA 2011"},{"key":"8","first-page":"35","article-title":"An iterative thresholding algorithm for linear inverse problems","volume":"63","author":"daubechies","year":"0","journal-title":"Princeton Univ NJ Program in Applied and Computational Mathematics"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620348.pdf?arnumber=6620348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T13:11:38Z","timestamp":1490188298000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620348\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620348","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}