Stable Signal Recovery from Incomplete and Inaccurate Measurements

Suppose we wish to recover an n-dimensional real-valued vector x₀ (e. g. a digital signal or image) from incomplete and contaminated observations y = A x₀ + e; A is a n by m matrix with far fewer rows than columns (n << m) and e is an error term. Is it possible to recover x₀ accurately based on the data y? To recover x₀, we consider the solution x* to the l1-regularization problem min \|x\|₁ subject to \|Ax-y\|₂ <= epsilon, where epsilon is the size of the error term e. We show that if A obeys a uniform uncertainty principle (with unit-normed columns) and if the vector x₀ is sufficiently sparse, then the solution is within the noise level \|x* - x₀\|₂ C epsilon. As a first example, suppose that A is a Gaussian random matrix, then stable recovery occurs for almost all such A's provided that the number of nonzeros of x₀ is of about the same order as the number of observations. Second, suppose one observes few Fourier samples of x₀, then stable recovery occurs for almost any set of p coefficients provided that the number of nonzeros is of the order of n/ m⁶. In the case where the error term vanishes, the recovery is of course exact, and this work actually provides novel insights on the exact recovery phenomenon discussed in earlier papers. The methodology also explains why one can also very nearly recover approximately sparse signals.