摘要
游程编码是一种无损压缩算法,其简单、易于实现的特性也使它得到了广泛的应用。传统的游程编码选取固定的阈值区分特征字符和非特征字符,限制了压缩率的提高。从集合论的角度研究游程编码,提出了一种新的游程编码算法—集合游程,算法中不再使用阈值,而将全域字符划分成两个互不相交的集合,分别为特征字符和非特征字符,通过对特征字符进行合理的映射来表示连续出现次数,将游程编码算法的效率利用到了极限。最后,给出了集合划分的方法,并编程进行了验证,与原游程编码算法进行了比较。
Run Length Encoding (RLE) is a lossless compression algorithm and is widely used for it is simple and wieldy. The traditional RLE adopts fixed threshold to distinguish the special character and non - special character that limits the improvement of compression ratio. In this article we study the RLE from Set Theory and introduce a new RLE algorithm--Set RLE. The new algorithm, which doesn't use threshold any more, divides the macrocosm character into two not intersecting sets, which are special character set and non-special character set respectively. The times of appearance are expressed by reasonable mapping the special character, that makes the utilize rate of RLE reach its limit. At last, the division method is presented and validated by program. Meanwhile the new algorithm is compared with the traditional RLE.
出处
《计算机与数字工程》
2008年第12期32-34,共3页
Computer & Digital Engineering