Application of tree-based searches to matching pursuit

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 6, Issue , 2001, Pages 3933-3936

  Cotter, S F ^a   Rao, B D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ITERATIVE METHODS; MATRIX ALGEBRA; TREES (MATHEMATICS); VECTORS; WAVELET TRANSFORMS;

GREEDY SEARCH METHOD; MATCHING PURSUIT; MODIFIED MATCHING PURSUIT ALGORITHM;

SIGNAL DETECTION;

EID: 0034848164     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Matching pursuit: Adaptive representations of images and sounds
2. Signal processing with the sparseness constraint
3. Sparse approximate solutions to linear systems
4. A branch and bound algorithm for feature subset selection
5. On the optimality of the backward greedy algorithm for the subset selection problem
6. Backward sequential elimination for sparse vector subset selection
7. Atomic decomposition by basis pursuit
8. An affine scaling methodology for best basis selection
9. Forward sequential algorithms for best basis selection
10. Sequential coding algorithms: A survey and cost analysis
11. Decoding of severely filtered modulation codes using the (M,L) algorithm
12. Matching pursuits with time-frequency dictionaries
13. Adaptive time-frequency decompositions