Sparse approximation property and stable recovery of sparse signals from noisy measurements

preprint2011arXivOpen access

Abstract

In this paper, we introduce a sparse approximation property of order ss for a measurement matrix A{\bf A}: ∥xs∥2≤D∥Ax∥2+βσs(x)sfor all x,\|{\bf x}_s\|_2\le D \|{\bf A}{\bf x}\|_2+ β\frac{σ_s({\bf x})}{\sqrt{s}} \quad {\rm for\ all} \ {\bf x}, where xs{\bf x}_s is the best ss-sparse approximation of the vector x{\bf x} in ℓ2\ell^2, σs(x)σ_s({\bf x}) is the ss-sparse approximation error of the vector x{\bf x} in ℓ1\ell^1, and DD and ββ are positive constants. The sparse approximation property for a measurement matrix can be thought of as a weaker version of its restricted isometry property and a stronger version of its null space property. In this paper, we show that the sparse approximation property is an appropriate condition on a measurement matrix to consider stable recovery of any compressible signal from its noisy measurements. In particular, we show that any compressible signalcan be stably recovered from its noisy measurements via solving an ℓ1\ell^1-minimization problem if the measurement matrix has the sparse approximation property with β∈(0,1)β\in (0,1), and conversely the measurement matrix has the sparse approximation property with β∈(0,∞)β\in (0,\infty) if any compressible signal can be stably recovered from its noisy measurements via solving an ℓ1\ell^1-minimization problem.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.