Martucci's Zero-tree Entropy (ZTE) coding algorithm exploits the advantages of discrete wavelet coding to improve the video quality of inter-frame coding. In this algorithm the wavelet tree is coded into three different tables, type, valz and valnz. Subsequently these three tables are arithmetic coded. However, the statistical variation of the distribution of the values and types are not considered in this categorization. We propose to decompose the zerotree such that this variation is taken into account. In our representation, values and the types are reorganized into hierarchical structures according to the sub band and the orientation. Our test results show that the proposed algorithm can reduce the bit rate per frame up to 73% over the Martucci's algorithm and performs better than EBCOT at higher bit rates.
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.
Copy
Hemantha Kodikara ARACHCHI, W. Anil C. FERNANDO, Eran A. EDIRISINGHE, "Novel Scanning Order for Improving the Bit Rate Performance of ZTE Video Coding" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 11, pp. 2977-2984, November 2006, doi: 10.1093/ietfec/e89-a.11.2977.
Abstract: Martucci's Zero-tree Entropy (ZTE) coding algorithm exploits the advantages of discrete wavelet coding to improve the video quality of inter-frame coding. In this algorithm the wavelet tree is coded into three different tables, type, valz and valnz. Subsequently these three tables are arithmetic coded. However, the statistical variation of the distribution of the values and types are not considered in this categorization. We propose to decompose the zerotree such that this variation is taken into account. In our representation, values and the types are reorganized into hierarchical structures according to the sub band and the orientation. Our test results show that the proposed algorithm can reduce the bit rate per frame up to 73% over the Martucci's algorithm and performs better than EBCOT at higher bit rates.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.11.2977/_p
Copy
@ARTICLE{e89-a_11_2977,
author={Hemantha Kodikara ARACHCHI, W. Anil C. FERNANDO, Eran A. EDIRISINGHE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Novel Scanning Order for Improving the Bit Rate Performance of ZTE Video Coding},
year={2006},
volume={E89-A},
number={11},
pages={2977-2984},
abstract={Martucci's Zero-tree Entropy (ZTE) coding algorithm exploits the advantages of discrete wavelet coding to improve the video quality of inter-frame coding. In this algorithm the wavelet tree is coded into three different tables, type, valz and valnz. Subsequently these three tables are arithmetic coded. However, the statistical variation of the distribution of the values and types are not considered in this categorization. We propose to decompose the zerotree such that this variation is taken into account. In our representation, values and the types are reorganized into hierarchical structures according to the sub band and the orientation. Our test results show that the proposed algorithm can reduce the bit rate per frame up to 73% over the Martucci's algorithm and performs better than EBCOT at higher bit rates.},
keywords={},
doi={10.1093/ietfec/e89-a.11.2977},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Novel Scanning Order for Improving the Bit Rate Performance of ZTE Video Coding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2977
EP - 2984
AU - Hemantha Kodikara ARACHCHI
AU - W. Anil C. FERNANDO
AU - Eran A. EDIRISINGHE
PY - 2006
DO - 10.1093/ietfec/e89-a.11.2977
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2006
AB - Martucci's Zero-tree Entropy (ZTE) coding algorithm exploits the advantages of discrete wavelet coding to improve the video quality of inter-frame coding. In this algorithm the wavelet tree is coded into three different tables, type, valz and valnz. Subsequently these three tables are arithmetic coded. However, the statistical variation of the distribution of the values and types are not considered in this categorization. We propose to decompose the zerotree such that this variation is taken into account. In our representation, values and the types are reorganized into hierarchical structures according to the sub band and the orientation. Our test results show that the proposed algorithm can reduce the bit rate per frame up to 73% over the Martucci's algorithm and performs better than EBCOT at higher bit rates.
ER -