Welcome![Sign In][Sign Up]
Location:
Search - Huffman coding

Search list

[Windows DevelopHuffman Coding

Description: Huffman coding for image Arithmetic Coding for image
Platform: | Size: 8368408 | Author: quietsound | Hits:

[SourceCodehuffman

Description: huffman编码-huffman coding
Platform: | Size: 8192 | Author: | Hits:

[VC/MFC用Matlab实现Huffman编码

Description: Huffman 这个名字,程序员们至少会联想到二叉树和二进制编码。的确,我们总以 Huffman 编码来概括 D.A.Huffman 个人对计算机领域特别是数据压缩领域的杰出贡献。我们知道,压缩 = 模型 + 编码,作为一种压缩方法,我们必须全面考虑其模型和编码两个模块的功效;但同时,模型和编码两个模块又相互具有独立性。-Huffman, programmers will at least think of a binary tree and binary coding. Indeed, we always Huffman coding to summarize D. A. Huffman personal computer areas, especially in the field of data compression outstanding contribution. We know that the compression encoding = model, as a compression method, we must take full account of two model and coding module effectiveness; But at the same time, model and coding module of two mutual independence.
Platform: | Size: 2048 | Author: 亞男 | Hits:

[Compress-Decompress algrithmsadaptive-huffman

Description: 自适应的哈夫曼编码程序,包括屏幕输出和文件保存。-Adaptive Huffman Coding procedures, including the screen output and save the file.
Platform: | Size: 5120 | Author: 陈文杰 | Hits:

[2D Graphichuffman

Description: matlab实现huffman编码 1. norm2huff.m (encoder function) 2. huff2norm.m (decoder function) 3. frequency.m (private function) 4. huffcodes2bin.m (binary rapresentation of huffman codes) 5. huffman_bench1.m (benchmark) 6. huffman_demo1.m (demo file) 7. huffman_demo2.m (demo file) 8. huffman_test1.m (test file) 9. huffman_test2.m (test file) 10. huffman_docs.zip (documentation) 11. Disclamer.txt (this is the disclamer)-huffman coding matlab realize 1. norm2huff.m (encoder function) 2. huff2norm.m (decoder function) 3. frequency.m (private function) 4. huffcodes2bin.m (binary rapresentation of huffman codes) 5. huffman_bench1.m (benchmark ) 6. huffman_demo1.m (demo file) 7. huffman_demo2.m (demo file) 8. huffman_test1.m (test file) 9. huffman_test2.m (test file) 10. huffman_docs.zip (documentation) 11. Disclamer.txt (this is the disclamer)
Platform: | Size: 19456 | Author: lindajillduan | Hits:

[source in ebookHUFFMAN

Description: Huffman编码算法的C语言的源程序代码 (source code written in C programming language for algorithm of Huffman coding).-Huffman coding algorithm of the C language source code (source code written in C programming language for algorithm of Huffman coding).
Platform: | Size: 1024 | Author: 吴明 | Hits:

[3D GraphicHuffman

Description: 迄今为止见过的最方便的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 between 0 and N-1). 2) Set the value of each node to the number of times that its symbol appears in the data stream. 3) Create a Minimum-Heap of N nodes. 4) Add every node whose value is greater than zero to the heap. 5) Extract the best two nodes in the heap. 6) Create a parent node whose children are the two extracted nodes. 7) Add the parent node to the heap. 8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap). 9) Extract the last node in the heap. The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream. The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value 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 between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Platform: | Size: 17408 | Author: 游弋人生 | Hits:

[JSP/JavaHuffman

Description: Huffman编码的java实现。含实验报告。-Huffman coding to achieve the java. The report containing the experiment.
Platform: | Size: 3954688 | Author: 丙子 | Hits:

[Special EffectsAdaptive-Huffman-Coding

Description: Matlab实现自适应Huffman哈夫曼编码,这个Matlab实现的程序,实现用于一维8位或16位整数数组的自适应Huffman哈夫曼编码。-Matlab realize Huffman Adaptive Huffman Coding, the Matlab realize the procedures used to realize one-dimensional 8-bit or 16-bit integer array Huffman Adaptive Huffman Coding.
Platform: | Size: 38912 | Author: yy | Hits:

[VHDL-FPGA-VerilogHuffman

Description: 用于视频运动图像编码的HUFFMAN编码,可广泛运用于MPEG-Moving Picture for video coding Huffman coding, can be widely applied to MPEG
Platform: | Size: 1568768 | Author: zs | Hits:

[Compress-Decompress algrithmshuffman-adaptive

Description: huffman coding and decoding adaptive huffman coding and decoding it is a assignment from my course and code is main-c decode is main-e hope it is useful for everybody
Platform: | Size: 2509824 | Author: yuyu | Hits:

[Graph programhuffman-coding

Description: 小波均匀量化huffman熵编码图像压缩程序:分析对象Lena.bmp-Uniform quantization of wavelet image compression huffman entropy coding procedure: analysis of object Lena.bmp
Platform: | Size: 2048 | Author: yanhaifeixue | Hits:

[Compress-Decompress algrithmshuffman

Description: Huffman编解码完整代码,可支持文件读写。-Huffman coding and decoding. Both reading file and writing file are supported.
Platform: | Size: 5120 | Author: Yang | Hits:

[Compress-Decompress algrithmshuffman

Description: 从大量文档中筛选出来的有关huffman编码的几篇比较经典的文章,包括huffman基本算法,快速算法总结及改进,适合初学者及想深入了解Huffman算法的人员。-some paper about huffman coding,fast huffman
Platform: | Size: 1934336 | Author: tornado | Hits:

[Compress-Decompress algrithmshuffman

Description: huffman编码用于图像的压缩和解压,很好用的,可以用于各类图像的处理-huffman coding for image compression and decompression, useful, and can be used for all kinds of image processing
Platform: | Size: 2048 | Author: 唐宁 | Hits:

[Compress-Decompress algrithmsHuffmann-Coding-FPGA

Description: huffman coding in vhdl or verilog with explanation
Platform: | Size: 479232 | Author: sandeep | Hits:

[AlgorithmHuffman-coding

Description: 用哈夫曼编码进行文件压缩与解压, 通过输入文件名来计算字符种类与频数来计算权值-Huffman coding with file compression and decompression, the file name by entering the type and frequency to calculate the number of characters to calculate the weights
Platform: | Size: 10240 | Author: 陈雷 | Hits:

[Special Effectshuffman coding

Description: 利用霍夫曼编码进行图像压缩处理,此程序为霍夫曼编码的示例(The performance of a Huffman code is a function of the entropy of the signal distribution and therefore can be highly dependent in the transform domain in which the code is applied. For example, JPEG partitions an image into blocks of 8x8 pixels and then transforms these with a 2D Discrete Cosine Transform (DCT), similar to a DFT.)
Platform: | Size: 3072 | Author: Jessicapu | Hits:

[Compress-Decompress algrithmsHuffman

Description: Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source symbols, a short code being associated with the most frequent source symbols. A Huffman code is optimal in the sense of the shortest length for encoding by symbol, and a known probability distribution. More complex methods of probabilistic modeling of the source allow for better compression ratios.
Platform: | Size: 55296 | Author: manelb | Hits:

[Compress-Decompress algrithmsHuffman

Description: Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source symbols, a short code being associated with the most frequent source symbols. A Huffman code is optimal in the sense of the shortest length for encoding by symbol, and a known probability distribution. More complex methods of probabilistic modeling of the source allow for better compression ratios.
Platform: | Size: 15360 | Author: malikab | Hits:
« 12 3 4 5 6 7 8 9 10 ... 50 »

CodeBus www.codebus.net