Where is Randomness Needed to Break the Square-Root Bottleneck?

Details Where is Randomness Needed to Break the Square-Root Bottleneck? Where is Randomness Needed to Break the Square-Root Bottleneck?

2010-04-22

arxiv.org/abs/1004.3878v1

Computer Science

Information Theory

to appear at ISIT 2010, Austin, Texas

Scientific paper

As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all the positions of the nonzero entries of the sparse coefficient vector. Rather the positions corresponding to one of the two ONBs can be chosen arbitrarily. The two-ONB structure is, however, restrictive and does not reveal the property that is responsible for allowing to break the bottleneck with reduced randomness. For general dictionaries we show that if a sub-dictionary with small enough coherence and large enough cardinality can be isolated, the bottleneck can be broken under the same probabilistic model on the sparse coefficient vector as in the two-ONB case.

Affiliated with

Also associated with

No associations

Rating

Where is Randomness Needed to Break the Square-Root Bottleneck? 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 Where is Randomness Needed to Break the Square-Root Bottleneck?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Where is Randomness Needed to Break the Square-Root Bottleneck? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-459071