Paper
23 October 1996 Comparison of algorithms for the fast computation of the continuous wavelet transform
Michael J. Vrhel, Chulhee Lee, Michael A. Unser
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, and 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); https://doi.org/10.1117/12.255253
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelets

Continuous wavelet transforms

Finite impulse response filters

Optical filters

Digital filtering

Convolution

Protactinium

RELATED CONTENT

Fast algorithms for running wavelet analyses
Proceedings of SPIE (October 11 1994)
Fast fine-frequency demodulation with wavelets
Proceedings of SPIE (March 22 1999)
Wavelet and subband coding of images: a comparative study
Proceedings of SPIE (November 01 1993)
Time localization techniques for wavelet transforms
Proceedings of SPIE (October 25 1994)
Recursive wavelet filters for video coding
Proceedings of SPIE (June 24 2005)

Back to Top