http://iet.metastore.ingenta.com
1887

Sufficient condition for exact support recovery of sparse signals through greedy block coordinate descent

Sufficient condition for exact support recovery of sparse signals through greedy block coordinate descent

For access to this article, please select a purchase option:

Buy eFirst article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Signal Processing — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In the underdetermined model , where is a K-group sparse matrix (i.e. it has no more than K non-zero rows), the matrix 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 is recovered. We also show that GBCD fails in a more general case when .

http://iet.metastore.ingenta.com/content/journals/10.1049/iet-spr.2018.5123
Loading

Related content

content/journals/10.1049/iet-spr.2018.5123
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address