Paper
11 October 1994 Fast algorithms for running wavelet analyses
Author Affiliations +
Abstract
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michael A. Unser and Akram Aldroubi "Fast algorithms for running wavelet analyses", Proc. SPIE 2303, Wavelet Applications in Signal and Image Processing II, (11 October 1994); https://doi.org/10.1117/12.188780
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelets

Optical filters

Convolution

Wavelet transforms

Electronic filtering

Digital filtering

Electroencephalography

Back to Top