Limits of Deterministic Compressed Sensing Considering Arbitrary Orthonormal Basis for Sparsity

Details Limits of Deterministic Compressed Sensing Considering Arbitrary Orthonormal Basis for Sparsity Limits of Deterministic Compressed Sensing Considering Arbitrary Orthonormal Basis for Sparsity

2009-01-22

arxiv.org/abs/0901.3408v1

Computer Science

Information Theory

4 pages, submitted to SAMPTA2009

Scientific paper

It is previously shown that proper random linear samples of a finite discrete signal (vector) which has a sparse representation in an orthonormal basis make it possible (with probability 1) to recover the original signal. Moreover, the choice of the linear samples does not depend on the sparsity domain. In this paper, we will show that the replacement of random linear samples with deterministic functions of the signal (not necessarily linear) will not result in unique reconstruction of k-sparse signals except for k=1. We will show that there exist deterministic nonlinear sampling functions for unique reconstruction of 1- sparse signals while deterministic linear samples fail to do so.

Affiliated with

Also associated with

No associations

Rating

Limits of Deterministic Compressed Sensing Considering Arbitrary Orthonormal Basis for Sparsity 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 Limits of Deterministic Compressed Sensing Considering Arbitrary Orthonormal Basis for Sparsity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limits of Deterministic Compressed Sensing Considering Arbitrary Orthonormal Basis for Sparsity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-189160