Numerical Studies of the Generalized <i>l</i><sub>1</sub>Greedy Algorithm for Sparse Signals

• 作者: Edward Arroyo Fangjun Arroyo Jiehua Zhu Xiezhang Li
• 来源期刊: 计算机断层扫描(英文)
• 学科: 工学
• 关键词: Compressed Sensing Gaussian Sparse Signals l1-Minimization Reweighted l1-Minimization L1 GREEDY ALGORITHM Generalized L1 GREEDY ALGORITHM
• 年，卷（期）: 2013,（4）
• 页码范围: 132-139
• 页数: 8页
• 分类号: TP39

摘要

The generalized l1 greedy algorithm was recently introduced and used to reconstruct medical images in computerized tomography in the compressed sensing framework via total variation minimization. Experimental results showed that this algorithm is superior to the reweighted l1-minimization and l1 greedy algorithms in reconstructing these medical images. In this paper the effectiveness of the generalized l1 greedy algorithm in finding random sparse signals from underdetermined linear systems is investigated. A series of numerical experiments demonstrate that the generalized l1 greedy algorithm is superior to the reweighted l1-minimization and l1 greedy algorithms in the successful recovery of randomly generated Gaussian sparse signals from data generated by Gaussian random matrices. In particular, the generalized l1 greedy algorithm performs extraordinarily well in recovering random sparse signals with nonzero small entries. The stability of the generalized l1 greedy algorithm with respect to its parameters and the impact of noise on the recovery of Gaussian sparse signals are also studied.