An improved universal compression algorithm based on RLE
Gu Hui · Journal of Zhejiang University of Technology · 2007
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.