Harmonic analysis on Euclidean spaces Wavelets Concept
Wavelet packet decomposition
Summary
The wavelet packet decomposition generalizes the discrete wavelet transform. At every level it splits both the approximation and the detail coefficients again. The result is a full binary tree of coefficient sequences, which splits the frequency axis into bands of equal width instead of octaves. Each admissible subtree of this tree gives an orthonormal basis, so one signal has a very large library of bases to choose from. A best-basis search picks the subtree that represents a given signal most economically, which is useful in compression and denoising.
Further reading
About this page
| Tag | 2QKRBPS8B9 |
|---|---|
| URI | m2://2QKRBPS8B9 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 42C40, 65T60, 94A12 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.