Title :
Notes on the P-content algorithm
Author :
Ekstrand, Nicklas ; Smeets, Bart
Author_Institution :
Dept. of Inf. Technol., Lund Univ., Sweden
Abstract :
The P-context algorithm as introduced by Weinberger and Seroussi (see IEEE Trans. Inform. Theory, p.1697-1706, 1996) offers a way to reduce the parameter description costs. This paper concerns a possible improvement of the P-context algorithm. By using weighting techniques an accurate redundancy bound is derived and a possible implementation is proposed
Keywords :
data compression; parameter estimation; prediction theory; trees (mathematics); P-content algorithm; parameter description costs reduction; permutation minimal trees; prediction; redundancy bound; universal compression; weighting techniques; Cost function; Councils; Counting circuits; Genetic mutations; Image coding; Information technology; Merging; Vegetation mapping;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708626
