IEICE TRANSACTIONS on Communications
A New Image Coding Technique with Low Entropy Using a Flexible Zerotree
Summary :
A zerotree image-coding scheme is introduced that effectively exploits the inter-scale self-similarities found in the octave decomposition by a wavelet transform. A zerotree is useful for efficiently coding wavelet coefficients; its efficiency was proved by Shapiro's EZW. In the EZW coder, wavelet coefficients are symbolized, then entropy-coded for further compression. In this paper, we analyze the symbols produced by the EZW coder and discuss the entropy for a symbol. We modify the procedure used for symbol-stream generation to produce lower entropy. First, we modify the fixed relation between a parent and children used in the EZW coder to raise the probability that a significant parent has significant children. The modified relation is flexibly modified again based on the observation that a significant coefficient is more likely to have significant coefficients in its neighborhood. The three relations are compared in terms of the number of symbols they produce.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E81-B No.12 pp.2528-2535
- Publication Date
- 1998/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Source Encoding
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sanghyun JOO, Hisakazu KIKUCHI, Shigenobu SASAKI, Jaeho SHIN, "A New Image Coding Technique with Low Entropy Using a Flexible Zerotree" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 12, pp. 2528-2535, December 1998, doi: .
Abstract: A zerotree image-coding scheme is introduced that effectively exploits the inter-scale self-similarities found in the octave decomposition by a wavelet transform. A zerotree is useful for efficiently coding wavelet coefficients; its efficiency was proved by Shapiro's EZW. In the EZW coder, wavelet coefficients are symbolized, then entropy-coded for further compression. In this paper, we analyze the symbols produced by the EZW coder and discuss the entropy for a symbol. We modify the procedure used for symbol-stream generation to produce lower entropy. First, we modify the fixed relation between a parent and children used in the EZW coder to raise the probability that a significant parent has significant children. The modified relation is flexibly modified again based on the observation that a significant coefficient is more likely to have significant coefficients in its neighborhood. The three relations are compared in terms of the number of symbols they produce.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_12_2528/_p
Copy
@ARTICLE{e81-b_12_2528,
author={Sanghyun JOO, Hisakazu KIKUCHI, Shigenobu SASAKI, Jaeho SHIN, },
journal={IEICE TRANSACTIONS on Communications},
title={A New Image Coding Technique with Low Entropy Using a Flexible Zerotree},
year={1998},
volume={E81-B},
number={12},
pages={2528-2535},
abstract={A zerotree image-coding scheme is introduced that effectively exploits the inter-scale self-similarities found in the octave decomposition by a wavelet transform. A zerotree is useful for efficiently coding wavelet coefficients; its efficiency was proved by Shapiro's EZW. In the EZW coder, wavelet coefficients are symbolized, then entropy-coded for further compression. In this paper, we analyze the symbols produced by the EZW coder and discuss the entropy for a symbol. We modify the procedure used for symbol-stream generation to produce lower entropy. First, we modify the fixed relation between a parent and children used in the EZW coder to raise the probability that a significant parent has significant children. The modified relation is flexibly modified again based on the observation that a significant coefficient is more likely to have significant coefficients in its neighborhood. The three relations are compared in terms of the number of symbols they produce.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A New Image Coding Technique with Low Entropy Using a Flexible Zerotree
T2 - IEICE TRANSACTIONS on Communications
SP - 2528
EP - 2535
AU - Sanghyun JOO
AU - Hisakazu KIKUCHI
AU - Shigenobu SASAKI
AU - Jaeho SHIN
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1998
AB - A zerotree image-coding scheme is introduced that effectively exploits the inter-scale self-similarities found in the octave decomposition by a wavelet transform. A zerotree is useful for efficiently coding wavelet coefficients; its efficiency was proved by Shapiro's EZW. In the EZW coder, wavelet coefficients are symbolized, then entropy-coded for further compression. In this paper, we analyze the symbols produced by the EZW coder and discuss the entropy for a symbol. We modify the procedure used for symbol-stream generation to produce lower entropy. First, we modify the fixed relation between a parent and children used in the EZW coder to raise the probability that a significant parent has significant children. The modified relation is flexibly modified again based on the observation that a significant coefficient is more likely to have significant coefficients in its neighborhood. The three relations are compared in terms of the number of symbols they produce.
ER -
English
