Bit-Precision method for low complex lossless image coding

  • Authors:

  • Jong Woo Won;Hyun Soo Ahn;Wook Joong Kim;Euee S. Jang

  • Affiliations:

  • Jong Woo Won Computer division, College of Information and Communications, Hanyang University, Seoul, Korea;Jong Woo Won Computer division, College of Information and Communications, Hanyang University, Seoul, Korea;Wook Joong Kim, Senior Engineer Broadcasting Media Research Department, Radio & Broadcasting Research Laboratory, ETRI, Daejeon, Korea;Jong Woo Won Computer division, College of Information and Communications, Hanyang University, Seoul, Korea

  • Venue:
  • ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we proposed a novel entropy coding called bit-precision 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.