Generalized wavelet decompositions in image compression: arbitrary subbands and parallel algorithms

Andreas Uhl

doi:10.1117/1.601338

1 May 1997 Generalized wavelet decompositions in image compression: arbitrary subbands and parallel algorithms

Andreas Uhl

Optical Engineering, Vol. 36, Issue 5, (May 1997). https://doi.org/10.1117/1.601338

New methods for lossy image compression based on generalized wavelet decompositions have been introduced recently. Unlike in the classical wavelet decomposition scheme, it is possible to use different scaling and wavelet functions at every scale by using nonstationary multiresolution analyses. This freedom in using different functions can be exploited for adaptive compression techniques. We extend this approach to arbitrary subbands (e.g., in a wavelet packet scheme), combine it with the best basis algorithm, and introduce efficient techniques for using these algorithms on parallel computers.

Citation Download Citation

Andreas Uhl "Generalized wavelet decompositions in image compression: arbitrary subbands and parallel algorithms," Optical Engineering 36(5), (1 May 1997). https://doi.org/10.1117/1.601338

Published: 1 May 1997

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