Everything About ___
Live briefing

Everything about Fast wavelet transform

Mathematical algorithm

The fast wavelet transform is a mathematical algorithm designed to turn a waveform or signal in the time domain into a sequence of coefficients based on an orthogonal basis of small finite waves, or wavelets. The transform can be easily extended to multidimensional signals, such as images, where the time domain is replaced with the space domain. This algorithm was introduced in 1989 by Stéphane Mallat. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Fast wavelet transformA 5-minute orientation
  2. Skim a recent paper: A Deep Learning and Fast Wavelet Transform-Based Hybrid Approach for Denoising of PPG SignalsInfluential work since 2022
  3. Pick up a classic book: Computer Engineering and TechnologyThe most-reprinted book on the subject
  4. Read the landmark paper: Multiscale contrast enhancement for radiographies: Laplacian pyramid versus fast wavelet transformCited 165 times
  5. Go sideways: Discrete wavelet transformA closely related topic
  6. Go sideways: Orthogonal waveletA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Forward DWT
  2. Inverse DWT

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics