An efficient implementation of the backward greedy algorithm for sparse signal reconstruction

被引：27

作者：

Reeves, SJ ^{[1
]}

机构：

[1] Auburn Univ, Dept Elect Engn, Auburn, AL 36849 USA

来源：

IEEE SIGNAL PROCESSING LETTERS | 1999年 / 6卷 / 10期

关键词：

backward greedy algorithm; efficient algorithm; recursive; sparse signal reconstruction;

D O I：

10.1109/97.789606

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Recent work in sparse signal reconstruction has shown that the backward greedy algorithm can select the optimal subset of unknowns if the perturbation of the data is sufficiently small. We propose an efficient implementation of the backward greedy algorithm that yields a significant improvement in computational efficiency over the standard implementation. Furthermore, we propose an efficient algorithm for the case in which the transform matrix is too large to be stored. We analyze the computational complexity and compare the algorithms, and we illustrate the improved efficiency with examples.

引用

页码：266 / 268

页数：3