Comparison of Algorithms for the Fast Computation of the Continuous Wavelet Transform
M.J. Vrhel, C. Lee, M. Unser
Proceedings of the SPIE Conference on Mathematical Imaging: Wavelet Applications in Signal and Image Processing IV, Denver CO, USA, August 6-9, 1996, vol. 2825, part I, pp. 422–431.
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 straightforward 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.
@INPROCEEDINGS(http://bigwww.epfl.ch/publications/vrhel9602.html, AUTHOR="Vrhel, M.J. and Lee, C. and Unser, M.", TITLE="Comparison of Algorithms for the Fast Computation of the Continuous Wavelet Transform", BOOKTITLE="Proceedings of the {SPIE} Conference on Mathematical Imaging: {W}avelet Applications in Signal and Image Processing {IV}", YEAR="1996", editor="", volume="2825", series="", pages="422--431", address="Denver CO, USA", month="August 6-9,", organization="", publisher="", note="Part {I}")