Satisficing Search Algorithms for Selecting Near-Best Bases in ...https://www.researchgate.net/.../Satisficing-search-algorithms-for-selecting-near-best-b...

Download PDF
3 downloads 0 Views 203KB Size Report
Comment
from a large speech database containing sentences spoken in all major American ...... ble V lists the values of the mean segmental data com- pression number ...
Satisficing Search Algorithms for Selecting Near-Best Bases in Adaptive Tree-Structured Wavelet Transforms Carl Taswell Mallat and Zhang [3] developed a greedy algorithm for the selection of the best matching pursuit decomposition of a signal into time-frequency packets from a large collection of such packet waveforms. The matching pursuit decomposition can be performed either with or without backprojection [3], [4] resulting in either orthogonal or nonorthogonal decompositions. The computational cost of the non-orthogonal matching pursuit algorithm is O(M LN ) where M