Benchmarks for 2D discrete wavelet transforms

Uwe Meyer-Baese

doi:10.1117/12.342938

22 March 1999 Benchmarks for 2D discrete wavelet transforms

Uwe Meyer-Baese

Proceedings Volume 3723, Wavelet Applications VI; (1999) https://doi.org/10.1117/12.342938
Event: AeroSense '99, 1999, Orlando, FL, United States

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.

Citation Download Citation

Uwe Meyer-Baese "Benchmarks for 2D discrete wavelet transforms", Proc. SPIE 3723, Wavelet Applications VI, (22 March 1999); https://doi.org/10.1117/12.342938

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available