Sparse signal recovery by q minimization under restricted isometry property
Abstract
In the context of compressed sensing, the nonconvex q minimization with 0<q<1 has been studied in recent years. In this paper, by generalizing the sharp bound for 1 minimization of Cai and Zhang, we show that the condition δ(sq+1)k<1sq-2+1 in terms of 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 q minimization. This result is more general than the sharp bound for 1 minimization when the order of RIC is greater than 2k and illustrates the fact that a better approximation to 0 minimization is provided by q minimization than that provided by 1 minimization.
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.