Multi-iteration wavelet zero-tree coding for image compression.

DOI10.1016/S0165-1684(00)00035-9MaRDI QIDQ1575504zbMATH OpenOpenAlexFDO

Authors M. A. Losada, D. Fraile, A. Artés, Gülay Tohumoğlu

Publication date 21 August 2000

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0165-1684(00)00035-9

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for image processing (68U10)

Review text

Here, we present a modification of Shapiro's embedded zero-tree wavelet algorithm (EZW) for image codec. Shapiro's technique is based on the wavelet transform and on the self-similarity inherent in images. In the EZW, the wavelet transform (WT) coefficients, which provide a multiresolution representation of the image, are arranged according to their significance across scales using a small symbol set (zero-tree (ZT) coding). An analysis of the symbol entropy shows that better compression rates can be obtained when two or more iterations of the original algorithm are combined. Consequently, we propose a modification of Shapiro's original algorithm, which we call multi-iteration EZW, designed to optimise the combination of ZT and Huffman coding. We study the behaviour of the multi-iteration algorithm in terms of image quality and bit-rate for natural and medical images. Our findings show that for a given image quality the multi-iteration algorithms and particularly the two-iteration EZW produce lower bit-rates than Shapiro's. In addition, we suggest that the idea of multi-iteration can be generalised to other techniques based on ZT coding.

Recommendations

Cited in

(12)

This page was built for publication: Multi-iteration wavelet zero-tree coding for image compression.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575504)