How well can we estimate a sparse vector?

Details How well can we estimate a sparse vector? How well can we estimate a sparse vector?

2011-04-27

arxiv.org/abs/1104.5246v3

Computer Science

Information Theory

Scientific paper

The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on the mean-squared error, which holds regardless of the sensing/design matrix being used and regardless of the estimation procedure. This lower bound very nearly matches the known upper bound one gets by taking a random projection of the sparse vector followed by an $\ell_1$ estimation procedure such as the Dantzig selector. In this sense, compressive sensing techniques cannot essentially be improved.

Affiliated with

Also associated with

No associations

Rating

How well can we estimate a sparse vector? 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 How well can we estimate a sparse vector?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How well can we estimate a sparse vector? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-448062