Efficient implementation of the backward greedy algorithm for sparse signal reconstruction

IEEE Signal Processing Letters

Volumn 6, Issue 10, 1999, Pages 266-268

  Reeves, Stanley J ^a  

^a AUBURN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; PERTURBATION TECHNIQUES;

BACKWARD GREEDY ALGORITHMS; SPARSE SIGNAL RECONSTRUCTION;

SIGNAL RECONSTRUCTION;

EID: 0033329746     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/97.789606     Document Type: Article

References (5)

1. B. D. Rao, "Signal processing with sparseness constraint," in Proc. 1998 IEEE Int. Conf. Acoustics, Speech, and Signal Processing, 1998, pp. 1861-1864.
2. G. Harikumar, C. Couvreur, and Y. Bresler, "Fast optimal and suboptimal algorithms for sparse solutions to linear inverse problems," in Proc. 1998 IEEE Int. Conf. Acoustics, Speech, and Signal Processing, 1998, pp. 1877-1881.
3. C. Couvreur and Y. Bresler, "On the optimality of the backward greedy algorithm for the subset selection problem," to appear in SIAM J. Matrix Anal. Applic..
4. Standard Mathematical Tables.,30th ed. Boca Raton, FL: CRC, 1995.
5. G. H. Golub and C. Van Loan, Matrix Computations, 2nd ed. Baltimore, MD: Johns Hopkins Univ. Press. 1989.