We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Sufficient condition for exact support recovery of sparse signals through greedy block coordinate descent.
- Authors
Li, Haifeng; Liu, Guoqi; Zou, Jian
- Abstract
In the underdetermined model Y^=AX+N, where X is a K ‐group sparse matrix (i.e. it has no more than K non‐zero rows), the matrix A may be also perturbed. Theoretically, a more relaxed condition means that fewer measurements are required to ensure sparse recovery. In this study, a relaxed sufficient condition is proposed for greedy block coordinate descent (GBCD) under total perturbations based on the restricted isometry property in order to guarantee that the support of X is recovered. We also show that GBCD fails in a more general case when 1/(K+1)≤δK+1<1.
- Publication
IET Signal Processing (Wiley-Blackwell), 2019, Vol 13, Issue 2, p176
- ISSN
1751-9675
- Publication type
Article
- DOI
10.1049/iet-spr.2018.5123