Nonuniform Sparse Recovery with Subgaussian Matrices

Details Nonuniform Sparse Recovery with Subgaussian Matrices Nonuniform Sparse Recovery with Subgaussian Matrices

2010-07-14

arxiv.org/abs/1007.2354v2

Computer Science

Information Theory

Scientific paper

Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as $\ell_1$-minimization find the sparsest solution to certain systems of equations. Random matrices have become a popular choice for the measurement matrix. Indeed, near-optimal uniform recovery results have been shown for such matrices. In this note we focus on nonuniform recovery using Gaussian random matrices and $\ell_1$-minimization. We provide a condition on the number of samples in terms of the sparsity and the signal length which guarantees that a fixed sparse signal can be recovered with a random draw of the matrix using $\ell_1$-minimization. The constant 2 in the condition is optimal, and the proof is rather short compared to a similar result due to Donoho and Tanner.

Affiliated with

Also associated with

No associations

Rating

Nonuniform Sparse Recovery with Subgaussian Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nonuniform Sparse Recovery with Subgaussian Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonuniform Sparse Recovery with Subgaussian Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-121021