Efficient backward elimination algorithm for sparse signal representation using overcomplete dictionaries

IEEE Signal Processing Letters

Volumn 9, Issue 5, 2002, Pages 145-147

  Cotter, Shane F ^a   Kreutz Delgado, K ^a   Rao, B D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Backward elimination algorithm; Overcomplete dictionary; Sparse representation; Subset selection

Indexed keywords

ALGORITHMS; INVERSE PROBLEMS; MATRIX ALGEBRA; RANDOM NUMBER GENERATION; SET THEORY;

BACKWARD ELIMINATION ALGORITHMS;

SIGNAL PROCESSING;

EID: 0036578648     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2002.1009004     Document Type: Article

References (9)

1. An efficient implementation of the backward greedy algorithm for sparse signal reconstruction
2. Backward sequential elimination for sparse vector subset selection
3. Signal processing with the sparseness constraint
4. Sparse approximate solutions to linear systems
5. Forward sequential algorithms for best basis selection
6. An affine scaling methodology for best basis selection
7. On the optimality of the backward greedy algorithm for the subset selection problem