A Modified Embedded Zerotree Wavelet (MEZW) Algorithm for Image Compression

Authors:
A. Ouafi;A. Taleb Ahmed;Z. Baarir;A. Zitouni
Affiliations:
LESIA Laboratory of Research, Electronic Department, University of Biskra, Biskra, Algeria;LAMIH Laboratory of Research, University of Valenciennes, Valenciennes, France;LESIA Laboratory of Research, Electronic Department, University of Biskra, Biskra, Algeria;LESIA Laboratory of Research, Electronic Department, University of Biskra, Biskra, Algeria
Venue:
Journal of Mathematical Imaging and Vision
Year:
2008

Citing 9
Cited 0

Discrete cosine transform: algorithms, advantages, applications

Discrete cosine transform: algorithms, advantages, applications
The JPEG still picture compression standard

Communications of the ACM - Special issue on digital multimedia systems
Arithmetic coding for data compression

Communications of the ACM
Multi-iteration wavelet zero-tree coding for image compression

Signal Processing - Special issue on emerging techniques for communication terminals
Context modeling of wavelet coefficients in EZW-based lossless image coding

ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06
Quantifying the Coding Performance of Zerotrees of Wavelet Coefficients: Degree-k Zerotree

IEEE Transactions on Signal Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology
A zerotree wavelet video coder

IEEE Transactions on Circuits and Systems for Video Technology
A comparative study of DCT- and wavelet-based image coding

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a modification of the Shapiro's Embedded Zerotree Wavelet (EZW) algorithm. Our approach, called Modified EZW (MEZW), distributes entropy differently than Shapiro's by using six instead of four symbols used in EZW and also optimizes the coding by a binary grouping of elements before coding. This approach can produce results that are a significant improvement on the PSNR and compression ratio obtained by Shapiro, without affecting the computing time. These results are also comparable with those obtained using the SPIHT and SPECK algorithms.