搜索资源列表
EZWvc
- ezw算法的实例，这里，读者重点要掌握的是EZW.C和LIST.C中的内容，充分理解零树的概念。 -ezw algorithm examples here, readers focus is to get the LIST.C EZW.C and the content and fully understands the concept of zero tree.
AdaptiveHuffman
- 自适应huffman编码，即在编/解码过程中根据已编/解码数据来计算各个码字的概率，并动态调整huffman树。包括编码器和解码器。 在vc++.net 2003下开发-adaptive Huffman coding, that is the encoding / decoding process based encoding / decoding data to calculate various code word probability, Dynamic adjustment and
20060304073455509
- 基于小波变换的嵌入式图像零树编码与解码。-based on wavelet transform embedded images Zerotree encoding and decoding.
2dheap
- 基于小波变换的零树嵌入式图像编码和解码分析-based on wavelet transform Zerotree embedded image coding and decoding Analysis
conversions
- 基于小波变换的零树嵌入式图像编码和解码分析-based on wavelet transform Zerotree embedded image coding and decoding Analysis
zerotree
- 基于小波变换的零树嵌入式图像编码和解码分析-based on wavelet transform Zerotree embedded image coding and decoding Analysis
wtransform
- 基于小波变换的零树嵌入式图像编码和解码分析-based on wavelet transform Zerotree embedded image coding and decoding Analysis
pq
- 哈夫曼编码树算法-Huffman coding Tree Algorithm
霍夫曼树编码
- 哈夫曼树编码代码-Huffman code tree coding
Huffman123
- 给定若干个字符及其对应的权重，建造一颗高度尽可能小的Huffman树及字符的Huffman编码。-given a number of characters and their corresponding weights, construction of a high as possible Huffman tree and the character of Huffman coding.
matlabyeye
- 本算法是一个C语言编写的基于小波零树的图像压缩算法。-the algorithm is a C language based on wavelet zerotree image compression algorithm.
GaloisFieldArithmetic
- 心电图小波零树压缩演算法的研究-ECG wavelet compression algorithm is the tree of
树遍历
- 有关树的遍历问题-the tree traversal issue
哈弗曼树的编码与译码
- 哈夫曼编码 和哈弗曼树对文件的压缩 和解压缩
huffman.rar
- 实现哈夫曼树算法,用VS2005开发，并附有详细的文本说明！,Huffman
compressor
- 本程序使用C++编写，在VC2005上调试，完成了文件的读取，文件字符的统计以及压缩率的显示，哈夫曼树的建立，哈夫曼编码的实现，文件转换为哈夫曼编码成为压缩文件以及文件从压缩状态进行解码。并且以对话框的形式和用户交流，程序方便实用，既可以对文本进行压缩，有可以对图像进行压缩，效果都不错。-This procedure using C++ Prepared in VC2005 debug completed documents to read, document characters as wel
huffman
- 构造一颗霍夫曼树,输入叶子节点的字符及权重，输出字符对应的Huffman编码，还可以通过输入0.1编码翻译出对应的字符-Hoffman Construction of a tree, enter the leaf nodes and the weights of the characters, the output of the Huffman code corresponding characters can be translated by entering the correspondin
HuffmanTree
- 二叉树-哈弗曼树的应用，键盘输入一连串的字符串，最好不要超过10个，回车后输出相应的频率，同时，根据左历变，按顺序输出频率的！！很简单-Binary Tree- Havermann Tree Application
xiangkehong
- 树与二叉树转换，用的是c++ 实现任意形状的树（使用广义表的方式从键盘输入）与二叉树的相互转换的实现-iohdiuosopidiosjdksddd