
Proceedings Paper
Highly efficient entropy coding of multilevel images using a modified arithmetic codeFormat | Member Price | Non-Member Price |
---|---|---|
$17.00 | $21.00 |
Paper Abstract
In this paper, firstly we present a modified multiplication-free arithmetic, code that can improve the efficiency of the conventional multiplication-free arithmetic code by increasing the numbers of the estimated probability from 2 to 3 in a power unit range. Then, we describe the application of this modified algorithm to the entropy coding of multi-level images. In our entropy coding scheme, the multi-alphabet symbol string, which is input from the sequence of the zig-zag scanning data obtained by applying the ADCT compression algorithm to the original image, can be directly sent to the encoder, i.e., there is no need to decompose the symbols into a series of binary decisions. Finally, some simulation results will be given to show that good performance can be achieved with our coding scheme.
Paper Details
Date Published: 1 November 1991
PDF: 10 pages
Proc. SPIE 1605, Visual Communications and Image Processing '91: Visual Communication, (1 November 1991); doi: 10.1117/12.50234
Published in SPIE Proceedings Vol. 1605:
Visual Communications and Image Processing '91: Visual Communication
Kou-Hu Tzou; Toshio Koga, Editor(s)
PDF: 10 pages
Proc. SPIE 1605, Visual Communications and Image Processing '91: Visual Communication, (1 November 1991); doi: 10.1117/12.50234
Show Author Affiliations
Yan-Ping Chen, Univ. of Tokyo (Japan)
Yasuhiko Yasuda, Univ. of Tokyo (Japan)
Published in SPIE Proceedings Vol. 1605:
Visual Communications and Image Processing '91: Visual Communication
Kou-Hu Tzou; Toshio Koga, Editor(s)
© SPIE. Terms of Use
