A Bitplane Tree Weighting Method for Lossless Compression of Gray Scale Images
Summary :
A Bitplane Tree Weighting (BTW) method with arithmetic coding is proposed for lossless coding of gray scale images, which are represented with multiple bitplanes. A bitplane tree, in the same way as the context tree in the CTW method, is used to derive a weighted coding probability distribution for arithmetic coding with the first order Markov model. It is shown that the proposed method can attain better compression ratio than known schemes with MDL criterion. Furthermore, the BTW method can be extended to a high order Markov model by combining the BTW with the CTW or with prediction. The performance of these modified methods is also evaluated. It is shown that they attain better compression ratio than the original BTW method without increasing memory size and coding time, and they can beat the lossless JPEG coding.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.11 pp.2268-2271
- Publication Date
- 1997/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
- Source Coding/Channel Capacity
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
Mitsuharu ARIMURA, Hirosuke YAMAMOTO, Suguru ARIMOTO, "A Bitplane Tree Weighting Method for Lossless Compression of Gray Scale Images" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 11, pp. 2268-2271, November 1997, doi: .
Abstract: A Bitplane Tree Weighting (BTW) method with arithmetic coding is proposed for lossless coding of gray scale images, which are represented with multiple bitplanes. A bitplane tree, in the same way as the context tree in the CTW method, is used to derive a weighted coding probability distribution for arithmetic coding with the first order Markov model. It is shown that the proposed method can attain better compression ratio than known schemes with MDL criterion. Furthermore, the BTW method can be extended to a high order Markov model by combining the BTW with the CTW or with prediction. The performance of these modified methods is also evaluated. It is shown that they attain better compression ratio than the original BTW method without increasing memory size and coding time, and they can beat the lossless JPEG coding.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_11_2268/_p
Copy
@ARTICLE{e80-a_11_2268,
author={Mitsuharu ARIMURA, Hirosuke YAMAMOTO, Suguru ARIMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Bitplane Tree Weighting Method for Lossless Compression of Gray Scale Images},
year={1997},
volume={E80-A},
number={11},
pages={2268-2271},
abstract={A Bitplane Tree Weighting (BTW) method with arithmetic coding is proposed for lossless coding of gray scale images, which are represented with multiple bitplanes. A bitplane tree, in the same way as the context tree in the CTW method, is used to derive a weighted coding probability distribution for arithmetic coding with the first order Markov model. It is shown that the proposed method can attain better compression ratio than known schemes with MDL criterion. Furthermore, the BTW method can be extended to a high order Markov model by combining the BTW with the CTW or with prediction. The performance of these modified methods is also evaluated. It is shown that they attain better compression ratio than the original BTW method without increasing memory size and coding time, and they can beat the lossless JPEG coding.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - A Bitplane Tree Weighting Method for Lossless Compression of Gray Scale Images
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2268
EP - 2271
AU - Mitsuharu ARIMURA
AU - Hirosuke YAMAMOTO
AU - Suguru ARIMOTO
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1997
AB - A Bitplane Tree Weighting (BTW) method with arithmetic coding is proposed for lossless coding of gray scale images, which are represented with multiple bitplanes. A bitplane tree, in the same way as the context tree in the CTW method, is used to derive a weighted coding probability distribution for arithmetic coding with the first order Markov model. It is shown that the proposed method can attain better compression ratio than known schemes with MDL criterion. Furthermore, the BTW method can be extended to a high order Markov model by combining the BTW with the CTW or with prediction. The performance of these modified methods is also evaluated. It is shown that they attain better compression ratio than the original BTW method without increasing memory size and coding time, and they can beat the lossless JPEG coding.
ER -
English
