arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1211.2636cs.DS
收藏

PPM中通过压缩上下文建模的存储器与压缩比权衡

A memory versus compression ratio trade-off in PPM via compressed context modeling

M. Oguzhan Kulekci

摘要:

自引入以来,部分匹配预测(PPM)一直是无损文本压缩的事实上的黄金标准,其中已经提出了许多改进压缩比和速度的变体。然而,减少PPM方案的高空间需求并没有得到那么多的关注。本研究的重点是减少PPM的内存消耗,通过最近提出的压缩上下文建模,使用压缩表示的上下文的统计模型。与经典的上下文定义不同,CCM将上下文定义为在特定位置的前导字符串,它将上下文视为前导信息的量,实际上是通过压缩先前符号组成的比特流。我们观察到,通过使用CCM,数据结构,特别是上下文树,可以在更小的空间中实现,并呈现压缩比和空间需求之间的折衷。所进行的实验表明,这种权衡在低阶中特别有益,通过牺牲高达近7%的压缩比损失,在存储器中获得约20 - 25%的增益。

英文摘要:

Since its introduction prediction by partial matching (PPM) has always been a de facto gold standard in lossless text compression, where many variants improving the compression ratio and speed have been proposed. However, reducing the high space requirement of PPM schemes did not gain that much attention. This study focuses on reducing the memory consumption of PPM via the recently proposed compressed context modeling that uses the compressed representations of contexts in the statistical model. Differently from the classical context definition as the string of the preceding characters at a particular position, CCM considers context as the amount of preceding information that is actually the bit stream composed by compressing the previous symbols. We observe that by using the CCM, the data structures, particularly the context trees, can be implemented in smaller space, and present a trade-off between the compression ratio and the space requirement. The experiments conducted showed that this trade-off is especially beneficial in low orders with approximately 20 - 25 percent gain in memory by a sacrifice of up to nearly 7 percent loss in compression ratio.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑