Computer Science – Information Theory
Scientific paper
2010-10-09
Computer Science
Information Theory
Scientific paper
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse and compressible signals. Many recovery algorithms are known to succeed when the restricted isometry constants of the sampling matrix are small. Many potential applications of compressed sensing involve a data-acquisition process that proceeds by convolution with a random pulse followed by (nonrandom) subsampling. At present, the theoretical analysis of this measurement technique is lacking. This paper demonstrates that the $s$th order restricted isometry constant is small when the number $m$ of samples satisfies $m \gtrsim (s \log n)^{3/2}$, where $n$ is the length of the pulse. This bound improves on previous estimates, which exhibit quadratic scaling.
Rauhut Holger
Romberg Justin
Tropp Joel A.
No associations
LandOfFree
Restricted Isometries for Partial Random Circulant 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 Restricted Isometries for Partial Random Circulant Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restricted Isometries for Partial Random Circulant Matrices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-221175