A Study on Lossy Compression Based on String Macthing

• MAEDA Koji

  School of Science and Engineering, Waseda University

• GOTO Masayuki

  School of Science and Engineering, Waseda University

• HIRASAWA Shigeichi

  School of Science and Engineering, Waseda University

Bibliographic Information

Other Title

• String Macthing に基づく有歪み圧縮に関する研究

Abstract

Y.Steinberg and M.Gutman proposed the lossy compression algorithm based on the string matching algorithm used in LZ77 code. Furthermore, Obata et.al proposed an improved algorithm which is efficient for finite i.i.d. sequence. This algorithm is a method which generates a new codeword nearby selected sequences. But this algorithm is not effective for the sources with finite memory. Then, we propose an efficient algorithm for Markov Source and show the characteristics of the algorithm from the simulation experiments.

Journal

• IEICE technical report. Information theory

  IEICE technical report. Information theory 98 (211), 7-12, 1998-07-24

  The Institute of Electronics, Information and Communication Engineers

Keywords

• Lossy Compression
• String Macthing Algoritm
• Markov Source

Details

• CRID: 1572261552259296768
• NII Article ID: 110003197491
• NII Book ID: AN10013083
• Text Lang: ja
• Data Source:
  • CiNii Articles