By Topic

The fast Haar transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kaiser, G. ; Center for Signals & Waves, VI, USA

Wavelet theory and its relatives (subband coding, filter banks and multiresolution analysis) have become hot this last decade. Like the sinusoids in Fourier analysis, wavelets form bases that can decompose (analyze) and reconstruct (synthesize) signals and images. As a by-product, we obtain the accompanying processing (filtering, compression, denoising, etc.). But unlike the sinusoids, there seems to be an inexhaustible variety of different wavelet types: orthogonal, biorthogonal, spline, smooth, rough, short, long and so forth. We construct the simplest wavelet algorithm possible, called the fast Haar transform (FHT). We then indicate how this may be generalized to other fast wavelet algorithms

Published in:

Potentials, IEEE  (Volume:17 ,  Issue: 2 )