Priority Method on Same Co-occurrence Count in Adaptive Rank-based Reindexing Scheme 


Vol. 30,  No. 12, pp. 1167-1174, Dec.  2005


PDF
  Abstract

In this paper, we propose a priority method on same co-occurrence count in adaptive rank-based reindexing scheme for lossless indexed image compression. The priority on same co-occurrence count in co-occurrence count matrix depends on a front count value on each raw of co-occurrence count matrix, a count value around diagonal line on each raw of the matrix, and a count value around large co-occurrence count on each raw of the matrix. Experimental results show that our proposed method can be reduced up to 1.71 bpp comparing with Zeng's and Pinho's method.

  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. S. You, H. J. Yoo, E. S. Jang, "Priority Method on Same Co-occurrence Count in Adaptive Rank-based Reindexing Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 12, pp. 1167-1174, 2005. DOI: .

[ACM Style]

Kang Soo You, Hee Jin Yoo, and Euee S. Jang. 2005. Priority Method on Same Co-occurrence Count in Adaptive Rank-based Reindexing Scheme. The Journal of Korean Institute of Communications and Information Sciences, 30, 12, (2005), 1167-1174. DOI: .

[KICS Style]

Kang Soo You, Hee Jin Yoo, Euee S. Jang, "Priority Method on Same Co-occurrence Count in Adaptive Rank-based Reindexing Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 12, pp. 1167-1174, 12. 2005.