Share Email Print

Proceedings Paper

Nonuniform spatially adaptive wavelet packets
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 4 December 2000
PDF: 9 pages
Proc. SPIE 4119, Wavelet Applications in Signal and Image Processing VIII, (4 December 2000); doi: 10.1117/12.408587
Show Author Affiliations
Philippe Carre, Univ. de Poitiers (France)
Christine Fernandez-Maloigne, Univ. de Poitiers (France)

Published in SPIE Proceedings Vol. 4119:
Wavelet Applications in Signal and Image Processing VIII
Akram Aldroubi; Andrew F. Laine; Michael A. Unser, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?