由行程编码改进的一种通用性压缩算法

An improved universal compression algorithm based on RLE

通过对行程编码(Run Length Encoding)的算法分析,提出了一种改进的无损压缩算法.该算法主要思路是:首先设定一个初始阈值,顺序扫描数据并记下最大值和最小值;当最大值和最小值的差值超过该阈值时,适当增大阈值;当差值不超过限定值时,将数据进行分段,根据实际情况对各分段数据采用本文介绍的差值编码或自然编码.解码过程中,根据包含最小值、起始位置、结束位置和该数据段需要的编码位数的信息文件和包含该段原始数据和最小值之间差值的差值文件还原数据.通过实例的测试和比较,给出了压缩效果公式,证明此算法比传统RLE算法的压缩效果更有效.

This paper brings forwards an improved compression algorithm of RLE based on analyzing the disadvantages of the RLE. At the beginning, the algorithm sets an initial threshold and writes down the maximum and minimum value during the process of scanning. When the difference value between the maximum value and minimum value exceeds the threshold, it enlarges the threshold properly as long as the threshold is less than the restricted value, then divided the dataflow into several segmentations and adopt the differential-coding or natural -coding defined in this paper according to the real situation. In the process of coding, the minimum value, start position, the end position, coding number of bits, and the document including the difference value between the original value and the minimum value are used in order to be reverted to the original data. The compression formula is given through testing and comparing of the instance. It has been proved that the algorithm presented in this paper is much more effective in the compression effect than the traditional RLE algorithm.