Lossless data compression using optimal tree machines

被引：0

作者：

Korodi, G ^{[1
]}

Rissanen, J ^{[1
]}

Tabus, I ^{[1
]}

机构：

[1] Tampere Univ Technol, Inst Signal Proc, FIN-33101 Tampere, Finland

来源：

DCC 2005: DATA COMPRESSION CONFERENCE, PROCEEDINGS | 2005年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at preventing expansion of the encoded string for data whose statistics deviate from those represented by the machines. The resulting algorithm is shown to have superior compression of short files compared to other methods.

引用

页码：348 / 357

页数：10

共 10 条

[1] Towards understanding and improving escape probabilities in PPM [J].

Aberg, J ;

Shtarkov, YM ;

Smeets, BJM .

DCC '97 : DATA COMPRESSION CONFERENCE, PROCEEDINGS, 1997, :22-31

[2]

Bell T. C., 1990, TEXT COMPRESSION

[3] DATA-COMPRESSION USING ADAPTIVE CODING AND PARTIAL STRING MATCHING [J].

CLEARY, JG ;

WITTEN, IH .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (04) :396-402

[4] IMPLEMENTING THE PPM DATA-COMPRESSION SCHEME [J].

MOFFAT, A .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1990, 38 (11) :1917-1921

[5] A UNIVERSAL DATA-COMPRESSION SYSTEM [J].

RISSANEN, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (05) :656-664

[6]

RISSANEN J, 2002, LOSSLESS DATA COMPRE

[7] GENERALIZED KRAFT INEQUALITY AND ARITHMETIC CODING [J].

RISSANEN, JJ .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1976, 20 (03) :198-203

[8] PPM: One step to practicality [J].

Shkarin, D .

DCC 2002: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2002, :202-211

[9] A UNIVERSAL FINITE MEMORY SOURCE [J].

WEINBERGER, MJ ;

RISSANEN, JJ ;

FEDER, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (03) :643-652

[10] THE ZERO-FREQUENCY PROBLEM - ESTIMATING THE PROBABILITIES OF NOVEL EVENTS IN ADAPTIVE TEXT COMPRESSION [J].

WITTEN, IH ;

BELL, TC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) :1085-1094

← 1 →