A Robust Sequential Preprocessing Scheme for Efficient Lossless Image Compression

Nam-Yee Kim; Kang-Soo You; Hoon-Sung Kwak

A Robust Sequential Preprocessing Scheme for Efficient Lossless Image Compression

Nam-Yee Kim, Kang-Soo You, Hoon-Sung Kwak, Journal of Internet Computing and Services, Vol. 10, No. 1, pp. 75-82, Feb. 2009
Full Text:

Abstract

In this paper, we propose a robust preprocessing scheme for entropy coding in gray-level image. The issue of this paper is to reduce additional information needed when bit stream is transmitted. The proposed scheme uses the preprocessing method of co-occurrence count about gray-levels in neighboring pixels. That is, gray-levels are substituted by their ranked numbers without additional information. From the results of computer simulation, it is verified that the proposed scheme could be reduced the compression bit rate by up to 44.1%, 37.5% comparing to the entropy coding and conventional preprocessing scheme respectively. So our scheme can be successfully applied to the application areas that require of losslessness and data compaction.

Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
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

[APA Style]

Kim, N., You, K., & Kwak, H. (2009). A Robust Sequential Preprocessing Scheme for Efficient Lossless Image Compression. Journal of Internet Computing and Services, 10(1), 75-82.

[IEEE Style]

N. Kim, K. You, H. Kwak, "A Robust Sequential Preprocessing Scheme for Efficient Lossless Image Compression," Journal of Internet Computing and Services, vol. 10, no. 1, pp. 75-82, 2009.

[ACM Style]

Nam-Yee Kim, Kang-Soo You, and Hoon-Sung Kwak. 2009. A Robust Sequential Preprocessing Scheme for Efficient Lossless Image Compression. Journal of Internet Computing and Services, 10, 1, (2009), 75-82.