搜索资源列表
stl-huffman
- implement huffman algorithm with stl priority-queue, first you must have the file, then the result is saved-implement Huffman algorithm with stl prio rity - queue, first you must have the file, then the result is saved
huffman
- Library and command line program for Huffman encoding and decoding both files and chunks of memory. The encoder is a 2 pass encoder. The first pass scans the data and builds the Huffman tree. The second pass encodes the
Huffman
- 迄今为止见过的最方便的huffman编码，效率很高 一个外国人写的，很具有研究价值 Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes, representing N possible symbols (ranging
产生huffman编码
- huffman产生哈夫曼编码的源代码. ... generate huffman code //i present the i th code, j present from leaf to root in huffman tree //hfdata ... 第3 楼 一种思想。-Huffman coding produce the source code. Generate Huffman code ... / / i present
实验一 Huffman编码源码
- Huffman编码1． 给出信源符号的一阶概率分布，并计算信源符号熵和单字符Huffman码表。2． 计算每信源的平均字长，并与信源符号熵比较。3． 比较压缩效果。-Huffman coding 1. Source symbols are given first-order probability distribution, and calculate the entropy source and single-character sy
产生huffman编码
- huffman产生哈夫曼编码的源代码. ... generate huffman code //i present the i th code, j present from leaf to root in huffman tree //hfdata ... 第3 楼 一种思想。-Huffman coding produce the source code. Generate Huffman code ...// i present t
动态哈夫曼的改进
- 来有人提出了一种动态的哈夫曼编码方法。动态哈夫曼编码使用一棵动态变化的哈夫曼树，对第t+1个字符的编码是根据原始数据中前t个字符得到的哈夫曼树来进行的，编码和解码使用相同的初始哈夫曼树，每处理完一个字符，编码和解码使用相同的方法修改哈夫曼树，所以-was raised to a dynamic Huffman coding method. Dynamic Huffman coding using a dynamic changes in
jpg_DCT
- 实现基本JPEG的压缩和编码 ％ 1． 首先通过DCT变换去除数据冗余； ％ 2． 使用量化表对DCT系数进行量化； ％ 3． 对量化后的系数进行Huffman编码。 -achieve basic JPEG compression and coding% 1. First through DCT remove data redundancy; % 2. Using quantitative table right DCT
mashu
- 初学者可以看看，因为这是我第一次用matlab编程,是图像压缩的huffman 编码的码树-beginners can see, because this is the first time I have used Matlab programming, image compression is Huffman coding code tree
stl-huffman
- implement huffman algorithm with stl priority-queue, first you must have the file, then the result is saved-implement Huffman algorithm with stl prio rity- queue, first you must have the file, then the result is saved
huffman_code
- huffman编码. 把一个英文字母,空格,句号.一共有28个 character. 先求每个字符出现的频率. 然后用频率对这个文件进行哈夫曼编码. 然后再进行解码. 运行的时候需要在VC++ 工程->设置->调试->程序变量里加E:\sample.txt E:\encode.txt E:\decode.txt 然后把英文文件放到E盘里.名叫samole.txt, 还有在E里新件2个
hu
- 实现基本JPEG的压缩和编码分三个步骤: 1. 首先通过DCT变换去除数据冗余； 2. 使用量化表对DCT系数进行量化； 3. 对量化后的系数进行Huffman编码。-Realize the basic JPEG compression and encoding is divided into three steps: 1. First of all, through the DCT transform to remove
Compression
- 几种常用的压缩算法 本程序包含以下功能： 1、 Arithmetic coding 2、 Huffman coding 3、 LZ77 coding 4、 LZ78 coding 5、 LZW 6、 RLE 7、 DCT 8、 Furie transform -Several commonly used compression algorithm This procedure includes t
huffman
- Library and command line program for Huffman encoding and decoding both files and chunks of memory. The encoder is a 2 pass encoder. The first pass scans the data and builds the Huffman tree. The second pass encodes the
Huffman
- 迄今为止见过的最方便的huffman编码，效率很高 一个外国人写的，很具有研究价值 Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes, representing N possible symbols (ranging
JPEG
- 实现JPEG的压缩和编码 （1）首先通过DCT变换去除数据冗余； （2）使用量化表对DCT系数进行量化； （3）对量化后的系数进行Huffman编码。 -The realization of JPEG compression and coding (1) First of all, through the DCT transform to remove data redundancy (2) the use of qu
cs
- 这是专门为 C# 开发者定制的 ZC030X 编程接口。C# 开发者可以如下方式进行调用： 首先需要进行声明： ... using System.Runtime.InteropServices public class win32{ [DllImport("zc030xlib.dll", EntryPoint = "capInitCamera")] public static extern int capI
JPEGcompression
- 1．首先通过DCT变换去除数据冗余； 2．使用量化表对DCT系数进行量化； 3．对量化后的系数进行Huffman编码。 具体源程序由主程序及两个子程序（DCT量化、Huffman编码）组成： -1. First of all, through the DCT transform to remove data redundancy 2. The use of quantization table of quantizat
Huffman
- 霍夫曼编码的基本方法是先对图像数据扫描一遍，计算出各种像素出现的概率，按概率的大小指定不同长度的唯一码字，由此得到一张该图像的霍夫曼码表。编码后的图像数据记录的是每个像素的码字，而码字与实际像素值的对应关系记录在码表中。 GUI实现(The basic method of Huffman coding is to scan the image data first, calculate the probability of occur
huffman编码
- input The number of weights n (n>1) is first entered. Then the N weights are entered in turn (the weight is a positive integer greater than 0). output Corresponding to the input n weight value, the correspondi