Location:
Search - huffman.m d
Search list
Description: This file contains a new and improved version of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful when using Matlab for data compression: quantizer, different variants of run-length-encoding and end-of-block coding in Mat2Vec, and a program which do JPEG-like entropy coding. A complete compression example is shown in TestMat2Vec.m. This file is all you need for Huffman coding in MatLab.-This file contains a new and improved version of on of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful wh en using Matlab for data compression : quantizer. different variants of run-length-encoding an d end-of-block coding in Mat2Vec. and a program which do JPEG-like entropy coding . A complete compression example is shown in Tes tMat2Vec.m. This file is all you need for Huffma n coding in MatLab.
Platform: |
Size: 25410 |
Author: 金金 |
Hits:
Description: 分而治之方法还可以用于实现另一种完全不同的排序方法，这种排序法称为快速排序（quick sort）。在这种方法中， n 个元素被分成三段（组）：左段l e f t，右段r i g h t和中段m i d d l e。中段仅包含一个元素。左段中各元素都小于等于中段元素，右段中各元素都大于等于中段元素。因此l e f t和r i g h t中的元素可以独立排序，并且不必对l e f t和r i g h t的排序结果进行合并。m i d d l e中的元素被称为支点( p i v o t )。图1 4 - 9中给出了快速排序的伪代码,,Delphi
赫夫曼编码.rar.rar - 用delhi做的程序实现了哈夫曼编码，做的还不错。,,Delphi
-divide and rule method can be used to achieve an entirely different sort of way This sorting called Quick Sort (quick sort). In this approach, n elements is divided into three (group) : Left of the l e f t, Right of g h i r t and middle m i d e d l. Middle contains only one element. Left of the elements are less than equal to the middle element of the right elements are larger than the middle element. So l and f t e r t h i g of elemental independent sort, and no need to l and f t e r t h i g ranking results merger. M i d e d l The element known as Fulcrum (p i v o t). Figure 1 4-9 is given a quick sort of pseudo-code. Delphi Hefuman coding. rar.rar - delhi do with the realization of Huffman coding. doing quite well. ,, Delphi
Platform: |
Size: 2489430 |
Author: 罗成芝 |
Hits:
Description: 实现最优二叉树的构造；在此基础上完成哈夫曼编码器与译码器。 假设报文中只会出现如下表所示的字符：
字符 A B C D E F G H I J K L M N
频度 186 64 13 22 32 103 21 15 47 57 1 5 32 20 57
字符 O P Q R S T U V W X Y Z ， ．
频度 63 15 1 48 51 80 23 8 18 1 16 1 6 2
要求完成的系统应具备如下的功能：
1．初始化。从终端（文件）读入字符集的数据信息，。建立哈夫曼树。
2．编码：利用已建好的哈夫曼树对明文文件进行编码，并存入目标文件（哈夫曼码文件）。
3．译码：利用已建好的哈夫曼树对目标文件（哈夫曼码文件）进行编码，并存入指定的明文文件。
4．输出哈夫曼编码文件：输出每一个字符的哈夫曼编码。
Platform: |
Size: 132535 |
Author: 张娟 |
Hits:
Description: This file contains a new and improved version of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful when using Matlab for data compression: quantizer, different variants of run-length-encoding and end-of-block coding in Mat2Vec, and a program which do JPEG-like entropy coding. A complete compression example is shown in TestMat2Vec.m. This file is all you need for Huffman coding in MatLab.-This file contains a new and improved version of on of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful wh en using Matlab for data compression : quantizer. different variants of run-length-encoding an d end-of-block coding in Mat2Vec. and a program which do JPEG-like entropy coding . A complete compression example is shown in Tes tMat2Vec.m. This file is all you need for Huffma n coding in MatLab.
Platform: |
Size: 25600 |
Author: 金金 |
Hits:
Description: 图像编码与均衡化规定化、
examplehaffuman.m 哈夫曼应用实例
examplepalar2.m 平面一般分割
examplepalar.m 平面分割 1-D 游程编码应用实例
lzwexample.m lzw编码的应用实例
erzhifenjie.m 平面的分割8层
suanshubianma.m 算术编码
code1.m 图像直方图均衡化处理
code2.m 图像直方图规定化处理-Image coding and equalization provisions of, examplehaffuman.m Huffman Application examplepalar2.m generally planar partition partition examplepalar.m plane 1-D run-length coding application lzwexample.m lzw the application of coding erzhifenjie.m plane partition 8 layer suanshubianma.m arithmetic coding code1.m image histogram equalization image histogram provides code2.m treatment of treatment
Platform: |
Size: 581632 |
Author: 赖官铨 |
Hits:
Description: 实现最优二叉树的构造；在此基础上完成哈夫曼编码器与译码器。 假设报文中只会出现如下表所示的字符：
字符 A B C D E F G H I J K L M N
频度 186 64 13 22 32 103 21 15 47 57 1 5 32 20 57
字符 O P Q R S T U V W X Y Z ， ．
频度 63 15 1 48 51 80 23 8 18 1 16 1 6 2
要求完成的系统应具备如下的功能：
1．初始化。从终端（文件）读入字符集的数据信息，。建立哈夫曼树。
2．编码：利用已建好的哈夫曼树对明文文件进行编码，并存入目标文件（哈夫曼码文件）。
3．译码：利用已建好的哈夫曼树对目标文件（哈夫曼码文件）进行编码，并存入指定的明文文件。
4．输出哈夫曼编码文件：输出每一个字符的哈夫曼编码。
Platform: |
Size: 132096 |
Author: 张娟 |
Hits:
Description: 本文是信息论与编码里的huffman码的编码程序，它能直接运行，并且起到实际的效果-This is the information theory and coding in the huffman code encoding process, it can directly run, and play a practical effect
Platform: |
Size: 4096 |
Author: 花剑 |
Hits:
Description: 课程设计：
1.求出在一个n×n的棋盘上，放置n个不能互相捕捉的国际象棋“皇后”的所有布局。
2.设计一个利用哈夫曼算法的编码和译码系统，重复地显示并处理以下项目，直到选择退出为止。
【基本要求】
1) 将权值数据存放在数据文件(文件名为data.txt，位于执行程序的当前目录中)
2) 分别采用动态和静态存储结构
3) 初始化：键盘输入字符集大小n、n个字符和n个权值，建立哈夫曼树；
4) 编码：利用建好的哈夫曼树生成哈夫曼编码；
5) 输出编码；
6) 设字符集及频度如下表：
字符 空格 A B C D E F G H I J K L M
频度 186 64 13 22 32 103 21 15 47 57 1 5 32 20
字符 N O P Q R S T U V W X Y Z
频度 57 63 15 1 48 51 80 23 8 18 1 16 1
-Curriculum design:
1. Obtained in an n × n chessboard, the place to catch each other should not n个chess "Queen" of all the layout.
2. The design of a use of Huffman coding and decoding algorithms systems, and deal with duplicate to show the following items until the exit date selection.
The basic requirements 【】
1) will be the right value data stored in data files (file named data.txt, located in the implementation of procedures in the current directory)
2), respectively, dynamic and static storage structure
3) Initialization: keyboard input character set size of n, n and n characters of the right value, set up Huffman tree
4) Coding: Using the built Huffman tree generated Huffman coding
5) output coding
6) The character set and the frequency of the following table:
Space characters A B C D E F G H I J K L M
Frequency of 186 64 13 22 32 103 21 15 47 57 1 5 32 20
Character N O P Q R S T U V W X Y Z
Frequency 57 63 15 1 48 51 80 23 8 18 1 16 1
Platform: |
Size: 550912 |
Author: 赵刚 |
Hits:
Description: 对一篇由英文字母、空格、标点符号构成的文档，进行Huffman编码
数据输入：
由文件input.txt给出输入数据。
输入文件示例
input.txt
A priority queue is a queue where each element has a priority and the element with the highest
priority is at the front of the queue and will be the first element to be removed.
输出文件示例
output.txt
各字符对应的哈夫曼编码为：
A：0101001 空格：01 句号：0101000 a：11010 b：011001 c:0101100 d:010101 e: 111
f:010111 g:0101101 h:1000 i: 1001 l:01000 m:01101 n:10110 o:11011 p:101000
q:101001 r:0111 s:01001 t:1100 u:10111 v:011000 w：101010 y:101011
原文档的哈夫曼编码输出：0101001011010000111100111011011110011100101011（太长了，后面
就不输了。。。）-On the one by the English letters, spaces, punctuation marks consisting of documents, Huffman coding data input: the file input.txt given input data. Sample input file input.txt A priority queue is a queue where each element has a priority and the element with the highest priority is at the front of the queue and will be the first element to be removed. Example output file output.txt each character corresponding Huffman is: A: 0101001 space: 01 period: 0101000 a: 11010 b: 011001 c: 0101100 d: 010101 e: 111 f: 010111 g: 0101101 h: 1000 i: 1001 l: 01000 m: 01101 n: 10110 o: 11011 p: 101000 q: 101001 r: 0111 s: 01001 t: 1100 u: 10111 v: 011000 w: 101010 y: 101011 original document Huffman coding output: 0101001011010000111100111011011110011100101011 (too long, back on the do not lose ..)
Platform: |
Size: 259072 |
Author: miyor |
Hits:
Description: 用下表给出的字符集和频度的实际统计数据建立哈夫曼树，并实现以下报文的编码和译码：“THIS PROGRAM IS MY FAVORITE”字符 A B C D E F G H I J K L M 频度 64 13 22 32 103 21 15 47 57 1 5 32 20 字符 N O P Q R S T U V W X Y Z 频度 57 63 15 1 48 51 80 23 8 18 1 16 1-The actual statistics of the character set and the frequency established by the following table shows the Huffman tree, and to achieve the following message encoding and decoding: " THIS PROGRAM IS MY FAVORITE" character ABCDEFGHIJKLM frequency 641,322,321,032,115 4757153220 characters NOPQRSTUVWXYZ frequency ° 57 ' 6,315,148,518,023,818,116 1
Platform: |
Size: 3072 |
Author: 梁耀燊 |
Hits:
Description: 根据赫夫曼编码的原理，编写一个程序建立英文字母的赫夫曼编码。下面是英文字母使用频率表（ ）：
A 8.19 B 1.47 C 3.83 D 3.91 E 12.25 F 2.26
G 1.71 H 4.57 I 7.10 J 0.14 K 0.41 L 3.77
M 3.34 N 7.06 O 7.26 P 2.89 Q 0.09 R 6.85
S 6.36 T 9.41 U 2.58 V 1.09 W 1.59 X 0.21
Y 1.58 Z 0.08
-According to Huffman coding theory, write a program to establish the letters of Huffman coding. Here is the English alphabet using frequency table ( )
Platform: |
Size: 2048 |
Author: lipei |
Hits:
Description: 设电文字符集D及各字符出现的概率F如下：
D={a，b，c，d，e，f，g，h}（字符数n=8）
F={5，29，7，8，14，23，3，11}( )
编写完成下列功能的程序：
①构造关于F的Huffman树；
②求出并打印D总各字符的Huffman编码。
程序结构： 类型说明；
构造Huffman树的函数：Huffman_tree(H[m+1])；
求Huffman编码的函数：Huffman_code(code[n+1])；
main()
{ 变量说明；
输入字符集D及频率F；
调用Huffman_tree(H)；
调用Huffman_code(code)；
打印编码；
Y 继续？
N
停止
}
-设电文字符集D及各字符出现的概率F如下：
D={a，b，c，d，e，f，g，h}（字符数n=8）
F={5，29，7，8，14，23，3，11}( )
编写完成下列功能的程序：
①构造关于F的Huffman树；
②求出并打印D总各字符的Huffman编码。
程序结构： 类型说明；
构造Huffman树的函数：Huffman_tree(H[m+1])；
求Huffman编码的函数：Huffman_code(code[n+1])；
main()
{ 变量说明；
输入字符集D及频率F；
调用Huffman_tree(H)；
调用Huffman_code(code)；
打印编码；
Y 继续？
N
停止
}
Platform: |
Size: 103424 |
Author: Kai |
Hits: