Inverse pyramid decomposition of wavelet spectrum for image compression
by Ivo Draganov
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 6, No. 1/2, 2014

Abstract: In this paper, a novel approach is presented for compression of digital images. It consists of finding the wavelet spectrum of an image into certain number of sub-bands after given levels of regular or irregular decomposition. Then each sub-band is decomposed with the inverse pyramid algorithm using some linear orthogonal transform such as DCT. Depending on whether a lossless or lossy compression is desired all or only some of the spectral coefficients from the inverse pyramid are preserved and then entropy coding is applied. Higher compression ratios are achieved at high image quality levels compared to some popular algorithms from the practice.

Online publication date: Sat, 22-Nov-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com