New Bounds for Restricted Isometry Constants

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this paper we show that if the restricted isometry constant $\delta_k$ of the compressed sensing matrix satisfies \[ \delta_k < 0.307, \] then $k$-sparse signals are guaranteed to be recovered exactly via $\ell_1$ minimization when no noise is present and $k$-sparse signals can be estimated stably in the noisy case. It is also shown that the bound cannot be substantively improved. An explicitly example is constructed in which $\delta_{k}=\frac{k-1}{2k-1} < 0.5$, but it is impossible to recover certain $k$-sparse signals.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

New Bounds for Restricted Isometry Constants 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 New Bounds for Restricted Isometry Constants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Bounds for Restricted Isometry Constants will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-659617

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.