23 October 1996 Comparison of algorithms for the fast computation of the continuous wavelet transform
Author Affiliations +
Abstract
We introduce a general framework for computing the continuous wavelet transform (CWT). Included in this framework is an FFT implementation as well as fast algorithms which achieve O(1) complexity per wavelet coefficient. The general approach that we present allows a straight forward comparison among a large variety of implementations. In our framework, computation of the CWT is viewed as convolving the input signal with wavelet templates that are the oblique projection of the ideal wavelets into one subspace orthogonal to a second subspace. We present this idea and discuss and compare particular implementations.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michael J. Vrhel, Chulhee Lee, Michael A. Unser, "Comparison of algorithms for the fast computation of the continuous wavelet transform", Proc. SPIE 2825, Wavelet Applications in Signal and Image Processing IV, (23 October 1996); doi: 10.1117/12.255253; https://doi.org/10.1117/12.255253
PROCEEDINGS
10 PAGES


SHARE
KEYWORDS
Wavelets

Continuous wavelet transforms

Finite impulse response filters

Optical filters

Digital filtering

Convolution

Protactinium

Back to Top