Nearly sharp sufficient conditions on exact sparsity pattern recovery

IEEE Transactions on Information Theory

Volumn 57, Issue 7, 2011, Pages 4672-4679

  Rad, Kamiar Rahnama ^a  

^a Columbia University ^*  (United States)

Author keywords

Hypothesis testing; random projections; sparsity pattern recovery; subset selection; underdetermined systems of equations

Indexed keywords

HYPOTHESIS TESTING; RANDOM PROJECTIONS; SPARSITY PATTERNS; SUBSET SELECTION; UNDERDETERMINED SYSTEMS OF EQUATIONS;

GAUSSIAN NOISE (ELECTRONIC); LINEAR SYSTEMS; MAXIMUM LIKELIHOOD; PROBABILITY;

RECOVERY;

EID: 79959550128     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2145670     Document Type: Article

References (13)

1. M. Zibulevsky and B. Pearlmutter, "Blind source separation by sparse decomposition in a signal dictionary," Neur. Comput., vol. 13, pp. 863-882, 2001. (Pubitemid 33594308)
2. W. Vinje and J. Gallant, "Sparse coding and decorrelation in primary visual cortex during natural vision," Science, vol. 287, no. 5456, pp. 1273-1276, 2000. (Pubitemid 30112150)
3. D. di Bernardo, M. J. Thompson, T. Gardner, S. E. Chobot, E. L. Eastwood, A. P. Wojtovich, S. J. Elliott, S. Schaus, and J. J. Collins, "Chemogenomic profiling on a genome-wide scale using reverse-engineered gene networks," Nat. Biotech, vol. 23, pp. 377-383, Mar. 2005. (Pubitemid 41094431)
4. M.Wainwright, "Information-theoretic limitations on sparsity recovery in the high-dimensional and noisy setting," IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5728-5741, Dec. 2009.
5. M. Akcakaya and V. Tarokh, "Shannon-theoretic limits on noisy compressive sampling," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 492-504, Jan. 2010.
6. A. Fletcher, S. Rangan, and V. Goyal, "Necessary and sufficient conditions on sparsity pattern recovery," IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5758-5772, Dec. 2009.
7. A. Karbasi, A. Hormati, S. Mohajer, and M.Vetterli, "Support recovery in compressed sensing: An estimation theoretic approach," in Proc. 2009 IEEE Int. Symp. Information Theory, 2009.
8. W. Wang, M. Wainwright, and K. Ramchandran, "Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices," IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2967-2979, Jun. 2010.
9. G. Reeves and M. Gastpar, "Sampling bounds for sparse support recovery in the presence of noise," in Proc. IEEE Int. Symp. Information Theory, 2008, pp. 2187-2191.
10. M. J. Wainwright, "Sharp thresholds for noisy and high-dimensional recovery of sparsity using ℓ1 -constrained quadratic programming (lasso)," IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2183-2202, May 2009.
11. H. Rauhut, K. Schnass, and P. Vandergheynst, "Compressed sensing and redundant dictionaries," IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2210-2219, May 2008. (Pubitemid 351689557)
12. T. A. Severini, Elements of Distribution Theory. Cambridge, U.K.: Cambridge University Press, 2005.
13. P. Bjorstad and J. Mandel, "On the spectra of sums of orthogonal projections with applications to parallel computing," BIT Numer. Math., vol. 31, pp. 76-88, 1991.