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

Fingerprint

Continuous Wavelet Transform
wavelet analysis
Wavelet transforms
fast Fourier transformations
Wavelets
Subspace
Oblique Projection
Fast Fourier transforms
templates
projection
Wavelet Coefficients
Straight
Fast Algorithm
Template
coefficients
Computing
Framework

All Science Journal Classification (ASJC) codes

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

Cite this

@article{522a1cea8e074156bdd1b12981ebb7ba,
title = "Comparison of algorithms for the fast computation of the continuous wavelet transform",
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.",
author = "Vrhel, {Michael J.} and Chulhee Lee and Unser, {Michael A.}",
year = "1996",
month = "12",
day = "1",
doi = "10.1117/12.255253",
language = "English",
volume = "2825",
pages = "422--431",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

Comparison of algorithms for the fast computation of the continuous wavelet transform. / Vrhel, Michael J.; Lee, Chulhee; Unser, Michael A.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 2825, 01.12.1996, p. 422-431.

Research output: Contribution to journalConference article

TY - JOUR

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

AU - Vrhel, Michael J.

AU - Lee, Chulhee

AU - Unser, Michael A.

PY - 1996/12/1

Y1 - 1996/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=78751628499&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78751628499&partnerID=8YFLogxK

U2 - 10.1117/12.255253

DO - 10.1117/12.255253

M3 - Conference article

AN - SCOPUS:78751628499

VL - 2825

SP - 422

EP - 431

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -