Lesson plan
Fast wavelet transform
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. It has as theoretical foundation the device of a finitely generated, orthogonal multiresolution analysis (MRA). In the terms given there, one selects a sampling scale J with sampling rate of 2 J per unit interval, and projects the given signal f onto the space V_J ; in theory by computing the scalar products : s^{(J)}_n:=2^J \langle f(t),\varphi(2^J t-n) \rangle, where \varphi is the scaling function of the chosen wavelet transform; in practice by any suitable sampling procedure under the condition that the signal is highly oversampled, so : P_J[f](x):=\sum_{n\in\Z} s^{(J)}_n\,\varphi(2^Jx-n) is the orthogonal projection or at least some good approximation of the original signal in V_J . The MRA is characterised by its scaling sequence : a=(a_{-N},\dots,a_0,\dots,a_N) or, as Z-transform, a(z)=\sum_{n=-N}^Na_nz^{-n} and its wavelet sequence : b=(b_{-N},\dots,b_0,\dots,b_N) or b(z)=\sum_{n=-N}^Nb_nz^{-n} (some coefficients might be zero).…
Article summary
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. It has as theoretical foundation the device of a finitely generated, orthogonal multiresolution analysis (MRA). In the terms given there, one selects a sampling scale J with sampling rate of 2 J per unit interval, and projects the given signal f onto the space V_J ; in theory by computing the scalar products : s^{(J)}_n:=2^J \langle f(t),\varphi(2^J t-n) \rangle, where \varphi is the scaling function of the chosen wavelet transform; in practice by any suitable sampling procedure under the condition that the signal is highly oversampled, so : P_J[f](x):=\sum_{n\in\Z} s^{(J)}_n\,\varphi(2^Jx-n) is the orthogonal projection or at least some good approximation of the original signal in V_J . The MRA is characterised by its scaling sequence : a=(a_{-N},\dots,a_0,\dots,a_N) or, as Z-transform, a(z)=\sum_{n=-N}^Na_nz^{-n} and its wavelet sequence : b=(b_{-N},\dots,b_0,\dots,b_N) or b(z)=\sum_{n=-N}^Nb_nz^{-n} (some coefficients might be zero).…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.