Sciweavers

Share
NIPS
2008

Resolution Limits of Sparse Coding in High Dimensions

11 years 1 months ago
Resolution Limits of Sparse Coding in High Dimensions
This paper addresses the problem of sparsity pattern detection for unknown ksparse n-dimensional signals observed through m noisy, random linear measurements. Sparsity pattern recovery arises in a number of settings including statistical model selection, pattern detection, and image acquisition. The main results in this paper are necessary and sufficient conditions for asymptotically-reliable sparsity pattern recovery in terms of the dimensions m, n and k as well as the signal-tonoise ratio (SNR) and the minimum-to-average ratio (MAR) of the nonzero entries of the signal. We show that m > 2k log(n - k)/(SNR
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where NIPS
Authors Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
Comments (0)
books