Near-best Basis Selection Algorithms with Non-additive Information Cost Functions

  title={Near-best Basis Selection Algorithms with Non-additive Information Cost Functions},
  author={Carl Taswell},
Search algorithms for finding signal decompositions called near-best bases using decision criteria called non-additive information costs are proposed for selecting bases in wavelet packet transforms. These new methods are compared with the best bases and additive information costs of Coifman and Wickerhauser [1]. All near-best and best bases were also compared with the matching pursuit decomposition of Mallat and Zhang [2]. Preliminary experiments suggest that for the application of time… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 21 extracted citations


Publications referenced by this paper.
Showing 1-9 of 9 references

Wavelets on the interval and fast wavelet transforms

  • A. Cohen, I. Daubechies, P. Vial
  • Applied and Computational Harmonic Analysis, vol…
  • 1993
1 Excerpt

Signal processing and compression with wave packets

  • R. R. Coifman, Y. Meyer, S. Quake, M. V. Wickerhauser
  • tech. rep., Yale University, 1990.
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…