| | |
Summary: ~
32 IEEE SIGNAL PROCESSING LEPERS, VOL. 1, NO. 2, FEBRUARY 1994
On the Initialization of the Discrete
Wavelet Transform Algorithm
Patrice Abry and Patrick nand&
Abstruct- This letter shows that making use of the discrete
wavelet transform to analyse data implies performing a prelim-
inary initializationof the fast pyramidal algorithm. An approx-
imation enabling easy performance of such an initialization is
proposed.
I. MOTIVATION
IME-SCALEmethods have already proved relevant tools
Tin signal processing. In most cases, for data analysis,
one uses continuous wavelet transforms rather than a discrete
wavelet transform (DWT), which is usually used in coding.
However, we believe that, thanks to the fast pyramidal al-
gorithm and the minimum redundancy dyadic sampling, the
DWT is also an efficient tool when analysing experimental
data.
In this letter, our aim is to stress, via two simple examples,
|
