Translator Disclaimer
4 December 2000 Nonuniform spatially adaptive wavelet packets
Author Affiliations +
In this paper, we propose a new decomposition scheme for spatially adaptive wavelet packets. Contrary to the double tree algorithm, our method is non-uniform and shift- invariant in the time and frequency domains, and is minimal for an information cost function. We prose some-restrictions to our algorithm to reduce the complexity and permitting us to provide some time-frequency partitions of the signal in agreement with its structure. This new 'totally' non-uniform transform, more adapted than Malvar, Packets or dyadic double-tree decomposition, allows the study of all possible time-frequency partitions with the only restriction that the blocks are rectangular. It permits one to obtain a satisfying Time-Frequency representation, and is applied for the study of EEG signals.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Philippe Carre and Christine Fernandez-Maloigne "Nonuniform spatially adaptive wavelet packets", Proc. SPIE 4119, Wavelet Applications in Signal and Image Processing VIII, (4 December 2000);

Back to Top