基于标识的变位对折压缩算法研究  

Research of Identification-based Displacement on Folding Compression Algorithm

作　　者：周华君[1] 丁爱芬[1] 吕小俊[1] ZHOU Huajun;DING Aifen;LV Xiaojun(College of Information,Tourism and Culture College of Yunnan University,Lijiang,Yunnan,China 674199)

机构地区：[1]云南大学旅游文化学院信息学院

出　　处：《昆明学院学报》2019年第3期93-98,共6页Journal of Kunming University

摘　　要：为提高数据的无损压缩效率,采用基于标识的变位对折压缩算法对基于动态规划的图像无损压缩算法进行编码改进,将待压缩数据片段中的较大值数据片段进行对折变换,减少信息的表示位长度,增加数据雷同度,从而减少第1步动态规划方法压缩的数据段长度,同时增加第2步哈夫曼编码的数据重叠度,提高编码率.结果表明,通过动态规划、变位对折、哈夫曼编码3种方法的整合,提高了数据无损压缩效率.To improve the lossless compression efficiency of data, the identification-based displacement folding compression algorithm was used to improve the encoding of the image lossless compression algorithm based on dynamic programming. The larger data segments in the data segments to be compressed is folded to reduce the length of information representation and increase the similarity of data, thus reducing the length of data segments compressed by the first dynamic programming method and also increa sin g the data overlapping of Huffman Encoding in the second step to improve the coding rate. The results show that the efficiency of lossless data compression is effectively improved by integrating three methods: dynamic programming, displacement folding and Huffman Encoding.

关 键 词：动态规划 无损压缩 变位对折 哈夫曼编码 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]