BROWSE
Detail
Conference Paper
Bit-Precision Method for Low Complex Lossless Image Coding
Cited 1 time in 
Share 
Share
- Authors
- Jong Woo Won, Hyun Soo Ahn, Wook Joong Kim, Euee S. Jang
- Issue Date
- 2005-08
- Citation
- International Conference on Intelligent Computing (ICIC) 2005 (LNCS 3644), v.3644, pp.155-164
- Language
- English
- Type
- Conference Paper
- Abstract
- In this paper, we proposed a novel entropy coding called bitprecision method. Huffman coding and arithmetic coding are among the most popular methods for entropy-coding the symbols after quantization in image coding. Arithmetic coding outperforms Huffman coding in compression efficiency, while Huffman coding is less complex than arithmetic coding. Usually, one has to sacrifice either compression efficiency or computational complexity by choosing Huffman coding or arithmetic coding. We proposed a new entropy coding method that simply defines the bit precision of given symbols, which leads to a comparable compression efficiency to arithmetic coding and to the lower computation complexity than Huffman coding. The proposed method was tested for lossless image coding and simulation results verified that the proposed method produces the better compression efficiency than (single model) arithmetic coding and the substantially lower computational complexity than Huffman coding. © Springer-Verlag Berlin Heidelberg 2005.