Dynamic recovery for block sparse signals
详细信息 查看全文
- 作者：Junying Rena ; rjy@whu.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Chen Weia ; weichen@whu.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Lei Yua ; b ; ly94@duke.edu" class="auth_mail" title="E-mail the corresponding author ; Haijian Zhanga ; haijian.zhang@whu.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Hong Suna ; hongsun@whu.edu.cn" class="auth_mail" title="E-mail the corresponding author
- 关键词：Sparsity ; Block structured sparsity ; Dynamic system
- 刊名：Signal Processing
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：130
- 期：Complete
- 页码：197-203
- 全文大小：706 K
文摘
- •
Propose a dynamic system (D-BSS) combining with the structure information to solve the sparse recovery problem.
- •
The D-BSS is equivalent to the classical algorithm of group-lasso.
- •
The observation number needed of D-BSS is smaller.
- •
The convergence rate of D-BSS is faster.