Multi-iteration wavelet zero-tree coding for image compression. (Q1575504)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multi-iteration wavelet zero-tree coding for image compression. |
scientific article; zbMATH DE number 1493337
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-iteration wavelet zero-tree coding for image compression. |
scientific article; zbMATH DE number 1493337 |
Statements
Multi-iteration wavelet zero-tree coding for image compression. (English)
0 references
21 August 2000
0 references
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.
0 references
Image coding
0 references
Wavelets
0 references
Zero-trees
0 references
0.9155886
0 references
0.90611124
0 references
0.89808977
0 references
0.8874533
0 references