An Adaptive Rank-Based Reindexing Scheme for Lossless Indexed Image Compression 


Vol. 30,  No. 7, pp. 658-665, Jul.  2005


PDF
  Abstract

Re-assignment scheme of index in index image is called reindexing. It has been well known that index image can be reindexed without losslessness. In this paper, we introduces an adaptive rank based reindexing scheme using co-occurrence frequency between neighboring pixels. Original index image can be converted into rank image by the proposed scheme. Using the proposed scheme, a better compression efficiency can be expected because most of the reindexed values(rank) get distributed with a smaller variance than the original index image. Experimental results show that the proposed scheme achieves a much better compression performance over GIF, arithmetic coding, Zeng's algorithm and RIAC scheme.

  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, B. Lee, E. S. Jang, H. Kwak, "An Adaptive Rank-Based Reindexing Scheme for Lossless Indexed Image Compression," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 7, pp. 658-665, 2005. DOI: .

[ACM Style]

Kang-Soo You, Bong-Ju Lee, Euee S. Jang, and Hoon-Sung Kwak. 2005. An Adaptive Rank-Based Reindexing Scheme for Lossless Indexed Image Compression. The Journal of Korean Institute of Communications and Information Sciences, 30, 7, (2005), 658-665. DOI: .

[KICS Style]

Kang-Soo You, Bong-Ju Lee, Euee S. Jang, Hoon-Sung Kwak, "An Adaptive Rank-Based Reindexing Scheme for Lossless Indexed Image Compression," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 7, pp. 658-665, 7. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880