摘要
提出了一种分组无损图像压缩编码方法,该方法预先确定码字,码字由组号和组内码字表示两部分组成,每组中包含了2n个组内码字,组内码字长度不等。灰度级根据概率大小重新排序,与码字一一对应,得到新的编码表,由此达到图像压缩的目的。将此压缩编码方法与Huffman编码进行比较,比较结果表明,该方法在压缩比和编解码效率等方面都要优于Huffman编码。
A packet lossless image compression coding method is presented.This method pre-determines the code word,which is composed by the group number and the code word in the group,each group contains the 2n code word,so the length is different,then the gradation levels are rearranged to corresponde with the code word according to their probability,at last the new code table is obtained,thus the image compression is achieved.The paper finally makes a comparison between this compression code and the Huffman code,the new method is totally overwhelming over Huffman code in the aspects of compression ratio,coding and decoding efficiency and so on.
出处
《计算机工程与设计》
CSCD
北大核心
2010年第15期3447-3450,共4页
Computer Engineering and Design
关键词
无损图像压缩
统计概率
分组
压缩比
编解码效率
霍夫曼编码
lossless image compress
statistical probability
packet
compression ratio
coding and decoding efficiency
Huffman coding
