A Detailed Introduction to Wavelets
With Applications to Image Analysis and Lossless Coding

Instructor: Gerald Kaiser

Enrollment is limited to 10.

No previous knowledge of wavelet analysis will be assumed.



Twelve sessions, about 90 minutes each, with extra time for discussions:

  1. The Haar multiresolution analysis
  2. Subband coding
  3. Orthogonal and biorthogonal filter banks
  4. From filter banks to wavelets
  5. Sample applications using MATLAB
  6. Continuous time-scale analysis
  7. Continuous time-frequency analysis
  8. Bases and frames
  9. Sampling frames
  10. The lifting method
  11. Integer transforms and lossless coding
  12. Software demonstrations

    Note: The new JPEG2000 and MPEG-4 standards are based on wavelet compression technology.

COURSE OUTLINE

  1. Haar analysis, discovered in 1910, already displays the essential elements of modern wavelet theory in their simplest form. The fast Haar transform (FHT) is a good alternative to the fast Fourier transform (FFT).
  2. We use the FHT as a paradigm to develop general subband coding schemes based on filter banks.
  3. Orthogonal filters generalize the FHT. Symmetric biorthogonal filters are preferable for compression. Biorthogonal spline filters are an example.
  4. Multiresolution analysis} embeds subband coding in continuous time. This leads from filter banks to continuous-time wavelets and reveals the stability of subband coding under recursions.
  5. Subband coding is extended to 2-D and applied to image analysis and compression, with many MATLAB examples. Questions addressed include: What makes an algorithm good for compression?
  6. We extend the wavelet transform to continuous time and scale and show how to filter in scale.
  7. Continuous time-frequency analysis is viewed as the narrowband limit of continuous time-scale analysis.
  8. Frames unify several ideas: orthogonal bases, biorthogonal bases, and continuous coherent-state representations as known in physics. This will be the basis for constructing physical wavelets.
  9. Sampling is possible in domains other than time and frequency. The ensuing sampling theorems include discrete wavelet and time-frequency representations.
  10. The lifting method is a very flexible way to construct fast wavelet transforms by breaking them into constituent ``atoms.'' The resulting algorithms are simpler, faster, and require less memory since they can be implemented "in-place." They are also more general, being able to deal naturally with boundaries and irregular sampling.
  11. Lifting can also be used to modify every FWT to an integer-valued algorithm, giving efficient and lossless coding by avoiding roundoff errors. We derive the two simplest examples, the S-transform and the ST transform, which are integer-valued versions of the Haar transform and the biorthogonal transform of order (3,1).
  12. Demonstrations will be given of wavelet software.



Short Courses taught 1994 - 2000



Return to home page