基于上下文的网格拓扑压缩熵编码方法  

Context-Based Entropy Encoding Method for Connectivity Compression of Meshes

作　　者：刘迎[1,2] 刘学慧[1,2] 孙春娟[1,2] 吴恩华[1,2,3] 

机构地区：[1]中国科学院软件研究所计算机科学国家重点实验室,北京100080 [2]中国科学院研究生院,北京100049 [3]澳门大学科学技术学院电脑与资讯科学系,中国澳门

出　　处：《软件学报》2008年第2期446-454,共9页Journal of Software

基　　金：Supported by the National Natural Science Foundation of China under Grant Nos.60373051, 60173022 (国家自然科学基金);the National Basic Research Program of China under Grant No.2002CB312102 (国家重点基础研究发展计划(973)); the China Research Grant of University of Macao (澳门大学研究基金)

摘　　要：提出了一种普遍适用于网格拓扑压缩的高效熵编码方法.不同于以往的单纯利用算术编码或Huffman编码对遍历网格生成的拓扑流进行编码压缩,对这些拓扑流的每个符号先计算其Huffman编码,然后采用基于上下文(已编码序列的倒数第2个符号作为上下文)的算术编码方法来编码其Huffman值,从而实现对网格模型拓扑信息的有效压缩.实验结果表明,熵编码方法普遍适用于各种网格拓扑压缩方法得到的拓扑流的压缩,其压缩结果普遍高于拓扑流序列的熵值——绝大多数拓扑压缩算法各自最好的压缩比.A general efficient algorithm for entropy encoding of the connectivity informauon oi meshes is presented in this paper. In comparison to the previous encoding methods, which use only Huffman or arithmetic coding method to encode operator series, this coding method can efficiently compress connectivity information by first calculating Huffman code for every symbol in connectivity series, followed by encoding the Huffman code through using a context-based arithmetic coding method. Experimental results indicate that this method can be applied to almost all the connectivity compression algorithms for meshes. The compression result by using this entropy encoding method is generally higher than the entropy of the series-the best compression result that most connectivity compression algorithms of mesh can obtain respectively .

关 键 词：HUFFMAN编码 基于上下文的算术编码 网格 拓扑压缩 编码 解码 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]