전기학회논문지P (The Transactions of the Korean Institute of Electrical Engineers P)

  • 제58권3호
  • /
  • Pages.285-290
  • /
  • 2009
  • /
  • 1229-800X(pISSN)
  • /
  • 2586-7792(eISSN)
대한전기학회 (The Korean Institute of Electrical Engineers)
권호 표지

새로운 무손실 유니버셜 데이터 압축 기법

A New Method of Lossless Universal Data Compression

  • 발행 : 2009.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we propose a new algorithm that improves the lossless data compression rate. The proposed algorithm lessens the redundancy and improves the compression rate evolutionarily around 40 up to 80 percentile depending on the characteristics of binary images used for compression. In order to demonstrate the superiority of the proposed method, the comparison between the proposed method and the LZ78 (LZ77) is demonstrated through experimental results theoretical analysis.

키워드

참고문헌

  1. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Trans, Inform. Theory, vol IT-22, pp. 75, 81, Jan. 1976
  2. C. Cook, A. Rosenfeld, and A. Aronson, "Grammatical inference by hill climbing", Inform, Sec., vol. 10, pp. 59-80, 1997
  3. C. evill-Manning and I. itten, "Identifying hierarchical structure in sequences: A linear-time algorithm," J. Artificial Intell. Res., vol. 7, pp. 67-82, 1997
  4. J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE Trans. on Information Theory, Vol. IT023, no. 3, May 1997
  5. J. Ziv, A. Lemple, "Compression of Individual Sequences via Variable Rate," IEEE Trans. on Information Theory, Vol. 24, no. 5, pp. 530-536, Sept., 1978 https://doi.org/10.1109/TIT.1978.1055934
  6. Y. Hershkovits and J. Ziv, "On Sliding-Window Universal Data Compression with Limited Memory," IEEE Trans. Information Theory, Vol. 44, no. 1, Jan 1998
  7. J. C. Kieffer, E. H. Yang, "Grammar-Based Codes: A New Class of Universal Lossless Source Codes", IEEE Trans. on Information Theory, Vol. 46, no. 3, pp. 737-754, 2000 https://doi.org/10.1109/18.841160
  8. E. Yang and J. C. Kieffer, "Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform-Part One : Without Context Models," IEEE Trans. on Information Theory, Vol. 46, no.3, May 2000
  9. J. C. Kieffer, E. Yang, G. J. Nelsom, and P. Cosman, "Universal Lossless Compression Via Multilevel Pattern Matching," IEEE Trans. on Information Theory, Vol. 46, no. 4, July 2000
  10. E. Yang, A. Kaltchenko, J. C. Kieffer, "Universal Lossless Data Compression With Side Information by Using a Conditional MPM Grammar Transform, " IEEE Trans. on Information Theory, Vol. 47, no. 6, Sep 2001
  11. J. C. Kieffer and E. Yang, "Structured Grammar-Based codes for universal lossless data compression," Communication in Information and Systems, Vol. 2, no. 1, pp.29-52, June 2002 https://doi.org/10.4310/CIS.2002.v2.n1.a2