Share Email Print

Proceedings Paper

Comparison of algorithms for the fast computation of the continuous wavelet transform
Author(s): Michael J. Vrhel; Chulhee Lee; Michael A. Unser
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 23 October 1996
PDF: 10 pages
Proc. SPIE 2825, Wavelet Applications in Signal and Image Processing IV, (23 October 1996); doi: 10.1117/12.255253
Show Author Affiliations
Michael J. Vrhel, National Institutes of Health (United States)
Chulhee Lee, National Institutes of Health (United States)
Michael A. Unser, National Institutes of Health (United States)

Published in SPIE Proceedings Vol. 2825:
Wavelet Applications in Signal and Image Processing IV
Michael A. Unser; Akram Aldroubi; Andrew F. Laine, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?