Share Email Print

Proceedings Paper

Benchmarks for 2D discrete wavelet transforms
Author(s): Uwe Meyer-Baese
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Wavelet transform can be computed in the time domain by direct, polyphase, or run-length methods. Alternatively FFT methods can be used. Typical comparison of the computational effort in the literature are based on the number of float multiplications or float multiplication and additions. The break even point of the time and FFT methods are computed based on this counting. But todays computer architecture are to complex (e.g. pipelining, cache and CPU register utilization) to archive precise results by counting. Benchmarks are reported in this paper to compare different methods. In addition MMX code will be shown to give essential speed-ups. The benchmarks are conducted in connection with the ESA-MAE image compression algorithm.

Paper Details

Date Published: 22 March 1999
PDF: 12 pages
Proc. SPIE 3723, Wavelet Applications VI, (22 March 1999); doi: 10.1117/12.342938
Show Author Affiliations
Uwe Meyer-Baese, Univ. of Florida (United States)

Published in SPIE Proceedings Vol. 3723:
Wavelet Applications VI
Harold H. Szu, Editor(s)

© SPIE. Terms of Use
Back to Top