"Compressed" Compressed Sensing

Details "Compressed" Compressed Sensing "Compressed" Compressed Sensing

2010-01-25

arxiv.org/abs/1001.4295v1

Computer Science

Information Theory

Scientific paper

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an even smaller number of samples is sufficient when there exists prior knowledge about the distribution of the unknown vector, or when only partial recovery is needed. An information-theoretic lower bound with connections to free probability theory and an upper bound corresponding to a computationally simple thresholding estimator are derived. It is shown that in certain cases (e.g. discrete valued vectors or large distortions) the number of samples can be decreased. Interestingly though, it is also shown that in many cases no reduction is possible.

Affiliated with

Also associated with

No associations

Rating

"Compressed" Compressed Sensing 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 "Compressed" Compressed Sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and "Compressed" Compressed Sensing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-130116