Location:
Search - huffman static
Search list
Description: static Huffman
Platform: |
Size: 12323 |
Author: 林语白 |
Hits:
Description: Contains a complete archiver by Haruhiko Okumura. The archiver uses
an LZ engine whose output is compressed with static Huffman. The
file is chopped into pieces which all get their own independent
set of Huffman tree s. ARJ 2.41, ZIP 2.0 and PKZIP 2.04g use
essentially the same method. ZOO and LHA even use excactly the
same method.- Contains a complete archiver by Haruhiko Okumura. The archiver uses an LZ engine whose output is compressed with static Huffman. The file is chopped into pieces which all get their own independent set of Huffman tree s. ARJ 2.41, ZIP 2.0 and PKZIP 2.04g use essentially the same method. ZOO and LHA even use excactly the same method.
Platform: |
Size: 1850177 |
Author: 吴绪林 |
Hits:
Description: ----
Huffman 算法的不同实现
本目录下的程序用8种不同的方式实现了Huffman编码算法，这8种方式分别是
* huffman_a 使用链表结构生成Huffman树的算法，这是最基本的实现方法，效率最低。
* huffman_b 使用《数据结构》（严蔚敏，吴伟民，1997，C语言版）中给出的算法，将二叉树存放在连续空间里（静态链表），空间的每个结点内仍有左子树、右子树、双亲等指针。
* huffman_c 使用Canonical Huffman编码，同时对huffman_b的存储结构进行改造，将二叉树存放在连续空间tree里，空间的每个结点类型都和结点权值的数据类型相同，空间大小为2*num，tree[0]未用，tree[1..num]是每个元素的权值，生成Huffman后，tree[1..2*num-1]中是双亲结点索引。
* huffman_d 在huffman_c的基础上，增加预先排序的功能先用QuickSort算法对所有元素的权值从小到大排序，这样，排序后最前面的两个元素就是最小的一对元素了。我们可以直接将它们挑出来，组合成一个子树。然后再子树的权值用折半插入法插到已排序的元素表中， 保证所有结点有序。为了保证初始元素的顺序不变，我们另外使用了一个索引数组，所有排序中的交换操作都是在索引数组中进行的----- Huffman algorithm to achieve Catalog under different procedures used eight different ways to achieve a Huffman coding algorithm, eight models were used huffman_a * Chain Structure Generation Huffman tree algorithm, This is the most basic method, the minimum efficiency. * Huffman_b use of "data structure" (Yan Wei Min, Xiulan WU Weimin, 1997, C language version) is the algorithm stored in a binary tree will be continuous space (static List), the space within each node still left subtree, right subtrees, parents and other indicators. * Canonical huffman_c use Huffman coding, while huffman_b storage structure transformation, will be stored in a binary tree continuous space tree, space each node type and the right node value of the same data type, size space for two * num, tree
Platform: |
Size: 32702 |
Author: ray |
Hits:
Description: Contains a complete archiver by Haruhiko Okumura. The archiver uses
an LZ engine whose output is compressed with static Huffman. The
file is chopped into pieces which all get their own independent
set of Huffman tree s. ARJ 2.41, ZIP 2.0 and PKZIP 2.04g use
essentially the same method. ZOO and LHA even use excactly the
same method.- Contains a complete archiver by Haruhiko Okumura. The archiver uses an LZ engine whose output is compressed with static Huffman. The file is chopped into pieces which all get their own independent set of Huffman tree s. ARJ 2.41, ZIP 2.0 and PKZIP 2.04g use essentially the same method. ZOO and LHA even use excactly the same method.
Platform: |
Size: 1850368 |
Author: 吴绪林 |
Hits:
Description: ----
Huffman 算法的不同实现
本目录下的程序用8种不同的方式实现了Huffman编码算法，这8种方式分别是
* huffman_a 使用链表结构生成Huffman树的算法，这是最基本的实现方法，效率最低。
* huffman_b 使用《数据结构》（严蔚敏，吴伟民，1997，C语言版）中给出的算法，将二叉树存放在连续空间里（静态链表），空间的每个结点内仍有左子树、右子树、双亲等指针。
* huffman_c 使用Canonical Huffman编码，同时对huffman_b的存储结构进行改造，将二叉树存放在连续空间tree里，空间的每个结点类型都和结点权值的数据类型相同，空间大小为2*num，tree[0]未用，tree[1..num]是每个元素的权值，生成Huffman后，tree[1..2*num-1]中是双亲结点索引。
* huffman_d 在huffman_c的基础上，增加预先排序的功能先用QuickSort算法对所有元素的权值从小到大排序，这样，排序后最前面的两个元素就是最小的一对元素了。我们可以直接将它们挑出来，组合成一个子树。然后再子树的权值用折半插入法插到已排序的元素表中， 保证所有结点有序。为了保证初始元素的顺序不变，我们另外使用了一个索引数组，所有排序中的交换操作都是在索引数组中进行的----- Huffman algorithm to achieve Catalog under different procedures used eight different ways to achieve a Huffman coding algorithm, eight models were used huffman_a* Chain Structure Generation Huffman tree algorithm, This is the most basic method, the minimum efficiency.* Huffman_b use of "data structure" (Yan Wei Min, Xiulan WU Weimin, 1997, C language version) is the algorithm stored in a binary tree will be continuous space (static List), the space within each node still left subtree, right subtrees, parents and other indicators.* Canonical huffman_c use Huffman coding, while huffman_b storage structure transformation, will be stored in a binary tree continuous space tree, space each node type and the right node value of the same data type, size space for two* num, tree
Platform: |
Size: 32768 |
Author: ray |
Hits:
Description: 静态的哈夫曼编码，从file.txt文件中读取字符，统计，并编码，输出到huffman-u.txt中-Static Huffman coding, the document read from file.txt characters, statistics, and coding, the output of the huffman-u.txt
Platform: |
Size: 4096 |
Author: 陈文杰 |
Hits:
Description: 本人早期用c++实现的静态哈夫曼编码,在vc2005上调试通过!-I spent the early c++ Realize static Huffman coding, debugging in vc2005 through!
Platform: |
Size: 479232 |
Author: 唐春晖 |
Hits:
Description: Generates a static minimum-variance Huffman code tree.，详细给出了HUFFMAN码树构造-Generates a static minimum-variance Huffman code tree., Details are given Huffman code tree structure
Platform: |
Size: 36864 |
Author: HARRY |
Hits:
Description: 动态Huffman编码与静态Huffman编码。Dynamic Huffman coding and static Huffman coding.-Dynamic Huffman encoding and static Huffman coding. Dynamic Huffman coding and static Huffman coding.
Platform: |
Size: 236544 |
Author: myb |
Hits:
Description: 该程序用ＶＣ实现了一个小型文件压缩与解压缩功能的程序，系统中使用静态二叉树，哈希表等数据结构，采用哈夫曼编码进行压缩与解压缩．-VC realize the program with a small file compression and decompression functions, systems use the static binary tree, hash table, such as data structure, the use of Huffman coding for compression and decompression.
Platform: |
Size: 10240 |
Author: wennaisong |
Hits:
Description: 这是专门为 C# 开发者定制的 ZC030X 编程接口。C# 开发者可以如下方式进行调用：
首先需要进行声明：
...
using System.Runtime.InteropServices
public class win32{
[DllImport("zc030xlib.dll", EntryPoint = "capInitCamera")]
public static extern int capInitCamera()
}-This is specifically for the C# Developer ZC030X customized programming interface. C# Developers can call the following manner: First of all, the need for a statement: ... using System.Runtime.InteropServices public class win32 ([DllImport (
Platform: |
Size: 14336 |
Author: mike |
Hits:
Description: 创建静态，动态的三叉霍夫曼树和编码，有向无环图的创建及拓扑排序，双向循环链表，表达式求值，单链表，集合在一起-Create static and dynamic Huffman tree of the trigeminal and coding, directed acyclic graph creation and topological sort, two-way circulation list, expression evaluation, single-chain, together
Platform: |
Size: 11264 |
Author: 3230133 |
Hits:
Description: 摘 要
文章以空间监控系统为背景,深入研究了JPEG图像压缩标准的实现方法,并基于FPGA对其进行了实现和优化。文中给出了详细的实现方法和优化过程,测试表明达到了很好的效果。
简单介绍了有损静态图像压缩当前有两种比较流行的标准JPEG和JPEG2000。说明了用JPEG方法压缩的原因。
介绍JPEG基本原理：JPEG对灰度图像的压缩处理过程主要包括:图像分割,离散余弦变换(DCT),量化(Quantization),“Z”形排序(Zigzag Scan),差分脉冲编码调制(Differential Pulse Code Modulation,DPCM)对直流系数(DC),行程长度编码(Run-Length Encoding,RLE)对交流系数(AC),霍夫曼(Huffman)编码等。
JPEG标准的特点是离散余弦变换。
比较详细介绍压缩系统的构成和实现。实现提及步骤， JPEG压缩模块设计和编码模块实现细节。
-Abstract
Article in the space monitoring system for the background, in-depth study of the JPEG image compression standard implementation methods and carried out based on FPGA implementation and optimization. In this paper, a detailed method of implementation and optimization of the process, testing showed that to achieve good results.
Easy introduction of harmful static image compression has two kinds of comparisons that the current popular standard JPEG and JPEG2000. Illustrated by the reasons for JPEG compression method.
JPEG introduce the basic principles: JPEG compression of gray-scale image processing include: image segmentation, discrete cosine transform (DCT), quantization (Quantization), "Z"-shaped sort (Zigzag Scan), differential pulse code modulation (Differential Pulse Code Modulation, DPCM) on the DC coefficient (DC), Run Length Encoding (Run-Length Encoding, RLE) of the exchange coefficient (AC), Hoffman (Huffman) coding.
JPEG standard is characterized by discrete
Platform: |
Size: 523264 |
Author: 压子 |
Hits:
Description: this program compress the given string based on the Static huffman algorithm-this program compress the given string based on the Static huffman algorithm
Platform: |
Size: 11264 |
Author: bhuvan |
Hits:
Description: Static Huffman Can download
Platform: |
Size: 1291264 |
Author: Khuong |
Hits:
Description: 利用静态链表建立赫夫曼树，建树过程中左子树权值小于右子树权值，求各结点的编码。叶子结点的个数n及结点值由键盘录入-Using static linked list to establish a Huffman tree, set during the process of weight less than the right subtree subtree weights, and each node coding. Leaf node of the number N and node values from the keyboard input
Platform: |
Size: 1024 |
Author: Loben |
Hits:
Description: 静态huffman算法，注视详细绝对实用可靠，希望对大家有所帮助-Static Huffman algorithm detailed, look absolutely reliable and practical, and they hope to help everyone
Platform: |
Size: 2048 |
Author: asdfghjkl |
Hits:
Description: huffman静态算法，有菜单，可以直接运行，希望对大家有帮助-Static Huffman algorithm, with the menu, can be directly run, and they hope to help everyone
Platform: |
Size: 3072 |
Author: asdfghjkl |
Hits:
Description: LZ 及huffman静态混合算法，算是对huffman算法的改进，可以直接运行，希望对大家有帮助-LZ and Huffman static mixture algorithm, is to improve the Huffman algorithm, can be directly run, and they hope to help everyone
Platform: |
Size: 4096 |
Author: asdfghjkl |
Hits:
Description: 基于静态huffman编码的文件压缩与解压-Huffman coding based on static file compression and decompression
Platform: |
Size: 114688 |
Author: 张孟亭 |
Hits: