An Efficient Lossless Compression Algorithm using Arithmetic Coding for Indexed Color Image 


Vol. 30,  No. 1, pp. 35-43, Jan.  2005


PDF
  Abstract

This paper introduces a new algorithm to improve compression performance of 256 color images called palette-based or indexed images. The proposed scheme counts each frequency of index values after present index value and determines each rank for every index value by sorting them in descending order Then, the scheme makes ranked index image instead of original indexed image using the way to replace index values with ranks. In the ranked index image's distribution produced as a result of tlus algorithm, the higher ranked index value, the more present same values Therefore, data redundancy will be raised and more efficient performance of compression can be expected Simulation results verify that because of higber compression ratio by up to 22.5, this newly designed algorithm shows a much better performance of compression in comparison with the anthmetic coding, intensity-based JPEG-LS and palette-based GIF.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. You, H. Lee, E. S. Jang, H. Kwak, "An Efficient Lossless Compression Algorithm using Arithmetic Coding for Indexed Color Image," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 1, pp. 35-43, 2005. DOI: .

[ACM Style]

Kang-Soo You, Han-Jeong Lee, Euee S. Jang, and Hoon-Sung Kwak. 2005. An Efficient Lossless Compression Algorithm using Arithmetic Coding for Indexed Color Image. The Journal of Korean Institute of Communications and Information Sciences, 30, 1, (2005), 35-43. DOI: .

[KICS Style]

Kang-Soo You, Han-Jeong Lee, Euee S. Jang, Hoon-Sung Kwak, "An Efficient Lossless Compression Algorithm using Arithmetic Coding for Indexed Color Image," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 1, pp. 35-43, 1. 2005.