Comparison of algorithms for the fast computation of the continuous wavelet transform

Michael J. Vrhel, Chulhee Lee, Michael A. Unser

Research output: Contribution to journalConference article

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)422-431
Number of pages10
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume2825
DOIs
Publication statusPublished - 1996 Dec 1
EventWavelet Applications in Signal and Image Processing IV - Denver, CO, United States
Duration: 1996 Aug 61996 Aug 6

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Comparison of algorithms for the fast computation of the continuous wavelet transform'. Together they form a unique fingerprint.

  • Cite this