其实验结果与哈夫曼编码做了比较，经过分析，此编码方法在灰度级概率均匀分布时具有优势。
Experimental results were compared with Huffman code, and through analyzing, this code method has advantage when probability of gray scale is distributed equally.
该方法通过先序遍历哈夫曼树，记录遍历过程，得到存储哈夫曼码表的一种数据结构。
The method gets a data structure for storing static Huffman coding by preordering traverse Huffman binary tree and recording the course of traverse.
哈夫曼编码是著名的数据压缩方法之一，它广泛适用于西文、中文、图象数据等领域的信息压缩之中。
Huffman encoding is one of the famous methods of data compression, It is used in the information compression in the fields of western languages, Chinese characters and pattern data etc.
本文通过介绍常见的图像压缩技术——哈夫曼编码和分形编码，提出了一些改进的方法。
This paper first introduces the common image compression technology-Huffman coding and fractal coding, and then proposes some improvements.
一般情况下，哈夫曼编码所采用的存储结构及构树方法，不仅影响编码效率，而且也没充分利用存储空间。
Generally, the storage of Huffman coding and the way of creating Huffman tree, which not only influence the coding efficiency, but also do not fully make use of the storage space.
本文中，给出了2种压缩测试模式的方法，一种是基于统计的哈夫曼编码，一种是基于差分运算的Golomb编码。
The paper proposes two methods for compressing tested pattern, one based on statistical Huffman code, the other based on differential Golomb code.
本文用图论中的最优树构成法证明哈夫曼编码方法是最小冗余的最优码。
In this paper it has been proved by the optimal tree construction of graph theory that Huffman's code is an optimal method of coding with minimum redundancy.
本文用图论中的最优树构成法证明哈夫曼编码方法是最小冗余的最优码。
In this paper it has been proved by the optimal tree construction of graph theory that Huffman's code is an optimal method of coding with minimum redundancy.
应用推荐