Data compression by multiresolution wavelet packet tree search
B. Patwiwat, Chee‐Hung Henry Chu, Chidchanok Lursinsap · 2002
The standard wavelet transform can be considered to be a subtree of a complete multiresolution binary tree, in which each branch corresponds to a decomposition step. Any subtree of this multiresolution tree which covers all leaves is a valid wavelet packet processing tree, which specifies the processing steps for a wavelet decomposition of the original data. This paper describes an adaptation scheme for configuring a wavelet packet processing tree using a genetic algorithm search of the complete multiresolution tree. Data compression is used as the target signal processing task, and performance is measured based on the reconstruction distortion.