Sharp upper bound on error probability of exact sparsity recovery

Proceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009

Volumn , Issue , 2009, Pages 14-17

  Rad, Kamiar Rahnama ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR PROBABILITIES; GAUSSIAN NOISE; GAUSSIANS; MEASUREMENT MATRIX; SPARSITY CONSTRAINTS; SPARSITY PATTERNS; SUFFICIENT CONDITIONS; UPPER BOUND;

ASYMPTOTIC ANALYSIS; GAUSSIAN NOISE (ELECTRONIC); INFORMATION SCIENCE; LINEAR SYSTEMS; TRAJECTORIES;

PROBABILITY;

EID: 70349656774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2009.5054681     Document Type: Conference Paper

References (4)

1. Akcakaya, M. and Tarokh, V. (2008). Noisy compressive sampling limits in linear and sub-linear regimes. 42nd Annual Conference on Information Sciences and Systems, pages 1-4.
2. Fletcher, A., Rangan, S., and Goyal, V. (2008). Necessary and sufficient conditions on spar-sity pattern recovery. Arxiv preprint arXiv0804.1839.
3. Wainwright, M. J. (2007). Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting. IEEE International Symposium on Information Theory, pages 961-965.
4. Wang, W., Wainwright, M., and Ramchandran, K. (2008). Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices. Arxiv preprint arXiv:0806.0604.