Wavelet packet decomposition


Originally known as Optimal Subband Tree Structuring also called Wavelet Packet Decomposition
is a wavelet transform where the discrete-time signal is passed through more filters than the discrete wavelet transform.

Introduction

In the DWT, each level is calculated by passing only the previous wavelet approximation coefficients through discrete-time low and high pass quadrature mirror filters. However, in the WPD, both the detail, cHj, cVj, cDj ) and approximation coefficients are decomposed to create the full binary tree.
Image:Wavelets - WPD.png|frame|none|Wavelet Packet decomposition over 3 levels. g is the low-pass approximation coefficients, h is the high-pass detail coefficients
For n levels of decomposition the WPD produces 2n different sets of coefficients as opposed to sets for the DWT. However, due to the downsampling process the overall number of coefficients is still the same and there is no redundancy.
From the point of view of compression, the standard wavelet transform may not produce the best result, since it is limited to wavelet bases that increase by a power of two towards the low frequencies. It could be that another combination of bases produce a more desirable representation for a particular signal. The best basis algorithm by Coifman and Wickerhauser finds a set of bases that provide the most desirable representation of the data relative to a particular cost function.
There were relevant studies in signal processing and communications fields to address the selection of subband trees of various kinds, e.g. regular, dyadic, irregular, with respect to performance metrics of interest including energy compaction, subband correlations and others.
Discrete wavelet transform theory offers an approximation to transform discrete signals. In contrast, the discrete subband transform theory provides a perfect representation of discrete signals.

Gallery

Applications

Wavelet packets were successfully applied in preclinical diagnosis.