东南大学学报（英文版）2016，Vol.32Issue(2)：164-169,6.DOI:10.3969/j.issn.1003-7985.2016.02.006
一种改进的稀疏度估计变步长匹配追踪算法
An improved sparsity estimation variable step-size matching pursuit algorithm
摘要
Abstract
To improve the reconstruction performance of the greedy algorithm for sparse signals, an improved greedy algorithm, called sparsity estimation variable step-size matching pursuit, is proposed. Compared with state-of-the-art greedy algorithms, the proposed algorithm incorporates the restricted isometry property and variable step-size, which is utilized for sparsity estimation and reduces the reconstruction time, respectively. Based on the sparsity estimation, the initial value including sparsity level and support set is computed at the beginning of the reconstruction, which provides preliminary sparsity information for signal reconstruction. Then, the residual and correlation are calculated according to the initial value and the support set is refined at the next iteration associated with variable step-size and backtracking. Finally, the correct support set is obtained when the halting condition is reached and the original signal is reconstructed accurately. The simulation results demonstrate that the proposed algorithm improves the recovery performance and considerably outperforms the existing algorithm in terms of the running time in sparse signal reconstruction.关键词
压缩感知/稀疏信号重构/匹配追踪/稀疏度估计Key words
compressed sensing/sparse signal reconstruction/matching pursuit/sparsity estimation分类
信息技术与安全科学引用本文复制引用
张若愚,赵洪林..一种改进的稀疏度估计变步长匹配追踪算法[J].东南大学学报（英文版）,2016,32(2):164-169,6.基金项目
The National Basic Research Program of China (973 Program)( No.2013CB329003) （973 Program）
