We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Electronics & Telecommunication Engineering/Multifrequency channel decompositions of images and wavelet models
PeriodicalsElectronics & Telecommunication Engineering

Multifrequency channel decompositions of images and wavelet models

Checking your access to this record.

Abstract & Overview

The author reviews recent multichannel models developed in psychophysiology, computer vision, and image processing. In psychophysiology, multichannel models have been particularly successful in explaining some low-level processing in the visual cortex. The expansion of a function into several frequency channels provides a representation which is intermediate between a spatial and a Fourier representation. The author describes the mathematical properties of such decompositions and introduces the wavelet transform. He reviews the classical multiresolution pyramidal transforms developed in computer vision and shows how they relate to the decomposition of an image into a wavelet orthonormal basis. He discusses the properties of the zero crossings of multifrequency channels. Zero-crossing representations are particularly well adapted for pattern recognition in computer vision.>

Cite this record

Stéphane Mallat (1989). Multifrequency channel decompositions of images and wavelet models. IEEE Transactions on Acoustics Speech and Signal Processing, 37(12), 2091–2110. https://doi.org/10.1109/29.45554

Copy in another style

Mallat, S. (1989). Multifrequency channel decompositions of images and wavelet models. IEEE Transactions on Acoustics Speech and Signal Processing, 37(12), 2091–2110. https://doi.org/10.1109/29.45554
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.