New Bounds for Restricted Isometry Constants

Abstract

In this paper we show that if the restricted isometry constant δk of the compressed sensing matrix satisfies \[ δk < 0.307, \] then k-sparse signals are guaranteed to be recovered exactly via 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 δk=k-12k-1 < 0.5, but it is impossible to recover certain k-sparse signals.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…