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

In this paper, we introduce a sparse approximation property of order $s$ for a measurement matrix ${\bf A}$: $$|{\bf x}s|2\le D |{\bf A}{\bf x}|2+ \beta \frac{\sigmas({\bf x})}{\sqrt{s}} \quad {\rm for\ all} \ {\bf x},$$ where ${\bf x}s$ is the best $s$-sparse approximation of the vector ${\bf x}$ in $\ell^2$, $\sigmas({\bf x})$ is the $s$-sparse approximation error of the vector ${\bf x}$ in $\ell^1$, and $D$ and $\beta$ 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 $\ell^{1$-minimization} problem if the measurement matrix has the sparse approximation property with $\beta\in (0,1)$, and conversely the measurement matrix has the sparse approximation property with $\beta\in (0,\infty)$ if any compressible signal can be stably recovered from its noisy measurements via solving an $\ell^{1$-minimization} problem.