pith. sign in

arxiv: 1310.2410 · v2 · pith:MACZFXMCnew · submitted 2013-10-09 · 💻 cs.IT · math.IT

Sparse signal recovery by ell_q minimization under restricted isometry property

classification 💻 cs.IT math.IT
keywords minimizationrecoverysparseboundcaseisometryprovidedrestricted
0
0 comments X
read the original abstract

In the context of compressed sensing, the nonconvex $\ell_q$ minimization with $0<q<1$ has been studied in recent years. In this paper, by generalizing the sharp bound for $\ell_1$ minimization of Cai and Zhang, we show that the condition $\delta_{(s^q+1)k}<\dfrac{1}{\sqrt{s^{q-2}+1}}$ in terms of \emph{restricted isometry constant (RIC)} can guarantee the exact recovery of $k$-sparse signals in noiseless case and the stable recovery of approximately $k$-sparse signals in noisy case by $\ell_q$ minimization. This result is more general than the sharp bound for $\ell_1$ minimization when the order of RIC is greater than $2k$ and illustrates the fact that a better approximation to $\ell_0$ minimization is provided by $\ell_q$ minimization than that provided by $\ell_1$ minimization.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.