Wavelet transforms versus Fourier transforms

DOI10.1090/S0273-0979-1993-00390-2MaRDI QIDQ4695330zbMATH OpenFDO

Publication date 9 September 1993

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9304214

dilation equations discrete cosine transform Fourier transforms image compression introduction to wavelets signal processing wavelet transform

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical interpolation (65D05)

Abstract: This note is a very basic introduction to wavelets. It starts with an orthogonal basis of piecewise constant functions, constructed by dilation and translation. The ``wavelet transform maps each $f (x)$ to its coefficients with respect to this basis. The mathematics is simple and the transform is fast (faster than the Fast Fourier Transform, which we briefly explain), but approximation by piecewise constants is poor. To improve this first wavelet, we are led to dilation equations and their unusual solutions. Higher-order wavelets are constructed, and it is surprisingly quick to compute with them --- always indirectly and recursively. We comment informally on the contest between these transforms in signal processing, especially for video and image compression (including high-definition television). So far the Fourier Transform --- or its 8 by 8 windowed version, the Discrete Cosine Transform --- is often chosen. But wavelets are already competitive, and they are ahead for fingerprints. We present a sample of this developing theory.

Recommendations

Cites work

Cited in

(32)

This page was built for publication: Wavelet transforms versus Fourier transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4695330)