Fast algorithms for the continuous wavelet transform

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

It is shown that filter banks arise naturally when implementing the continuous wavelet transform (CWT). The conditions under which the CWT can be computed exactly using discrete filter banks are determined, and fast CWT algorithms are derived. The complexity of the resulting algorithms increases linearly with the number of octaves. They are easily implemented by repetitive application of identical cells, to which various methods are applied for reducing the number of operations: FFT (fast Fourier transform) algorithms are most efficient for large filter lengths; for small lengths, fast running FIR (finite impulse response) algorithms are preferred.

Original languageEnglish
Title of host publicationProceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
PublisherPubl by IEEE
Pages2213-2216
Number of pages4
ISBN (Print)0780300033
DOIs
Publication statusPublished - 1 Jan 1991
Externally publishedYes
EventProceedings of the 1991 International Conference on Acoustics, Speech, and Signal Processing - ICASSP 91 - Toronto, Ont, Can
Duration: 14 May 199117 May 1991

Publication series

NameProceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
Volume3
ISSN (Print)0736-7791

Conference

ConferenceProceedings of the 1991 International Conference on Acoustics, Speech, and Signal Processing - ICASSP 91
CityToronto, Ont, Can
Period14/05/9117/05/91

Fingerprint

Dive into the research topics of 'Fast algorithms for the continuous wavelet transform'. Together they form a unique fingerprint.

Cite this