Towards understanding and improving escape probabilities in PPM

Author

Åberg, J. ; Shtarkov, Yu.M. ; Smeets, B.J.M.

Author_Institution

Dept. of Inf. Technol., Lund Univ., Sweden

fYear

1997

fDate

25-27 Mar 1997

Firstpage

22

Lastpage

31

Abstract

The choice of expressions for the coding probabilities in general, and the escape probability in particular, is of great importance in the family of prediction by partial matching (PPM) algorithms. We present a parameterized version of the escape probability estimator which, together with a “compactness” criterion, provides guidelines for the estimator design given a “representative” set of files. This parameterization also makes it possible to adapt the expression of the escape probability during one-pass coding. Finally, we present results for one such compression scheme that illustrates the usefulness of our approach

Keywords

adaptive estimation; data compression; encoding; parameter estimation; prediction theory; probability; PPM; coding probabilities; compactness criterion; data compression; escape probability estimator; estimator design; one-pass coding; prediction by partial matching algorithms; representative files; Algorithm design and analysis; Compression algorithms; Data compression; Guidelines; Information technology; Information theory; Probability; Source coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 1997. DCC '97. Proceedings

Conference_Location

Snowbird, UT

ISSN

1068-0314

Print_ISBN

0-8186-7761-9

Type

conf

DOI

10.1109/DCC.1997.581954

Filename

581954