Fast continuous wavelet transform

Michael Vrhel, Chulhee Lee, Michael Unser

Research output: Contribution to journalConference articlepeer-review

11 Citations (Scopus)


We introduce a general framework for the efficient computation of the continuous wavelet transform (CWT). The method allows arbitrary sampling along the scale axis, and achieves O(N) complexity per scale where N is the length of the signal. Our approach makes use of a compactly supported scaling function to approximate the analyzing wavelet. We derive error bounds on the wavelet approximation and show how to obtain any desired level of accuracy through the use of higher order representations. Finally, we present examples of implementation for different wavelets using polynomial spline approximations.

Original languageEnglish
Pages (from-to)1165-1168
Number of pages4
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Publication statusPublished - 1995
EventProceedings of the 1995 20th International Conference on Acoustics, Speech, and Signal Processing. Part 2 (of 5) - Detroit, MI, USA
Duration: 1995 May 91995 May 12

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering


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

Cite this