Fast Algorithms for Running Wavelet Analyses
M. Unser, A. Aldroubi
Proceedings of the SPIE Conference on Mathematical Imaging: Wavelet Applications in Signal and Image Processing II, San Diego CA, USA, July 24-29, 1994, vol. 2303, pp. 308–319.
We present a general framework for the design and efficient implementation of various types of running (or over-sampled) wavelet transforms (RWT) using polynomial splines. Unlike previous techniques, the proposed algorithms are not necessarily restricted to scales that are powers of two; yet they all achieve the lowest possible complexity : O(N) per scale, where N is signal length. In particular, we propose a new algorithm that can handle any integer dilation factor and use wavelets with a variety of shapes (including Mexican-Hat and cosine-Gabor). A similar technique is also developed for the computation of Gabor-like complex RWTs. We also indicate how the localization of the analysis templates (real or complex B-spline wavelets) can be improved arbitrarily (up to the limit specified by the uncertainty principle) by increasing the order of the splines. These algorithms are then applied to the analysis of EEG signals and yield several orders of magnitude speed improvement over a standard implementation.
@INPROCEEDINGS(http://bigwww.epfl.ch/publications/unser9403.html,
AUTHOR="Unser, M. and Aldroubi, A.",
TITLE="Fast Algorithms for Running Wavelet Analyses",
BOOKTITLE="Proceedings of the {SPIE} Conference on Mathematical
Imaging: {W}avelet Applications in Signal and Image Processing
{II}",
YEAR="1994",
editor="",
volume="2303",
series="",
pages="308--319",
address="San Diego CA, USA",
month="July 24-29,",
organization="",
publisher="",
note="")