Location:
Search - huffman stream
Search list
Description: 这是一个基于huffman编码的简单数据流压缩算法，只是一个方便学习huffman的算法-Huffman coding based on the simple data stream compression algorithm, convenience is a learning algorithm Huffman
Platform: |
Size: 196644 |
Author: 余叶文 |
Hits:
Description: Huffman编解码器的模拟实现
应用Huffman算法实现模拟编解码器，程序实现对输入的一篇英文文章(以 .txt文件读入)，输出Huffman 码流(以 .txt文件输出)，最好能实现译码过程。程序语言可以选用C、 VC或C++。-Huffman CODECs the simulation application Huffman algorithm simulation codecs, Programming on the importation of an article in English (. txt file income), Huffman code stream output (. txt files output), it would be desirable to achieve decoding process. The choice of programming language C, or C VC.
Platform: |
Size: 187201 |
Author: 吉尔 |
Hits:
Description: 实现jpeg图像解码功能。
代码设计思路：1, Reconstruct the Huffman/RLE stream to a sequence
2, Arrange the sequence to a matrix using the zigzag scanning backwards
3, Multiply the matrix by quantization table
4, Perform inverse DCT
5, Shift the values by +128
6, Transform back to RGB color space
Platform: |
Size: 186880 |
Author: 颜新卉 |
Hits:
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.
Platform: |
Size: 17786 |
Author: 游弋人生 |
Hits:
Description: （利用GIF_LZW算法实现的）网络图片传输 技术特点 ~~~~~~~~ 一、使用TCP协议传输数据。理由：稳定性好。 二、使用字节数据流进行传输，理由： A:VB的String存在自动Unicode转换问题，影响速度； B:可以直接发送8位字节数据，不需要使用Base64编码，从而减少了编码时间。 三、使用GIF-LZW压缩算法压缩图像。理由： A:行程编码、Huffman压缩算法压缩率太低； B:JPEG压缩算法需要太多位运算，且运算量大（有专门MMX优化算法），不利于VB实现； C:GIF-LZW压缩算法压缩率较好，且我已想出VB语法下高效GIF-LZW压缩/解压算法。 四、使用“有序抖动”算法进行 色彩量化。理由：“有序抖动”处理的结果具有一定规律性，有助于LZW类算法压缩。-(using GIF_LZW algorithm) picture transmission network ~~~~~~~~ a technical features, the use of TCP to transmit data. Reason : good stability. Two, the use of byte data stream for transmission, reasons : A : VB String exist automatically Unicode conversion, the impact speed; B : can directly send eight bytes of data and do not need to use Base64 encoding, thereby reducing the coding time. 3, the use of GIF - LZW compression algorithm for image compression. Reason : A : itinerary coding, Huffman compression algorithm compression rate is too low; B : JPEG compression algorithm needs much-bit computing, and large amount of computation (with MMX specialized optimization algorithm), is not conducive to VB; C : GIF - LZW compression algorithm compression ratio better, and I have come up with un
Platform: |
Size: 62518 |
Author: 房 |
Hits:
Description: Huffman编解码器的模拟实现
应用Huffman算法实现模拟编解码器，程序实现对输入的一篇英文文章(以 .txt文件读入)，输出Huffman 码流(以 .txt文件输出)，最好能实现译码过程。程序语言可以选用C、 VC或C++。-Huffman CODECs the simulation application Huffman algorithm simulation codecs, Programming on the importation of an article in English (. txt file income), Huffman code stream output (. txt files output), it would be desirable to achieve decoding process. The choice of programming language C, or C VC.
Platform: |
Size: 187392 |
Author: 吉尔 |
Hits:
Description: huffman码的解码器
根据码书 给一个二进制的码流文件解码-huffman code decoder code book in accordance to a binary stream file decoding
Platform: |
Size: 1024 |
Author: signal |
Hits:
Description: 赫夫曼编码与译码
本程序完全采用链式存储结构，用户在输入字符流后（无字符限制，无长度限制）（以EOF结束，即crtl+z），即可自动统计出现的字符，建立赫夫曼树，输出各字符的赫夫曼编码，翻译用户输入的字符流输出到文件中（output.txt)，最后进行译码，输出字符流。
可供学习《数据结构》（清华大学出版社）(P146赫夫曼编码）、《数据结构课程设计》（机械工业出版社）（P87赫夫曼编码的应用）时参考，本程序不同于书中的顺序存储结构，效率更高-Huffman encoding and decoding of this procedure completely chain storage structure, the user in the input stream of characters (no character limit, no length limit) (to EOF end, that is, crtl+ Z), will automatically appear and Statistics characters the establishment of Huffman tree, output of the Huffman coding of the characters, translate user input character stream output to a file (output.txt), the final decoding, the output character stream. For learning data structure (Tsinghua University Press) (P146 Huffman coding), Data Structure Course Design (Mechanical Industry Press) (P87 Application of Huffman coding) reference, this procedure is different from the book in the order in storage structures, efficient
Platform: |
Size: 3072 |
Author: XY Z |
Hits:
Description: /**
* 显示输入提示压缩或解压缩 继承了InputStream类，装有输入流。
*/
public class HZIPInputStream extends InputStream
{
/**
* HZIPInputStream 类的构造函数，定义了huffman树，输入流。
*
* @param in 输入流。
* @throws IOException：如果发生I/O错误则抛出异常。
*/-/*** Show input prompts compression or decompression InputStream inherited categories, with input streams.*/public class HZIPInputStream extends InputStream (/*** HZIPInputStream class constructor, the definition of a huffman tree, enter the stream.** @ Param in input stream.* @ Throws IOException: if there is I/O error is thrown.* /
Platform: |
Size: 75776 |
Author: stone |
Hits:
Description: 实现jpeg图像解码功能。
代码设计思路：1, Reconstruct the Huffman/RLE stream to a sequence
2, Arrange the sequence to a matrix using the zigzag scanning backwards
3, Multiply the matrix by quantization table
4, Perform inverse DCT
5, Shift the values by +128
6, Transform back to RGB color space
-Realize jpeg image decoding capabilities. Code design: 1, Reconstruct the Huffman/RLE stream to a sequence2, Arrange the sequence to a matrix using the zigzag scanning backwards3, Multiply the matrix by quantization table
Platform: |
Size: 186368 |
Author: 颜新卉 |
Hits:
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:
Description: 一、使用TCP协议传输数据。理由：稳定性好。
二、使用字节数据流进行传输，理由：
A:VB的String存在自动Unicode转换问题，影响速度；
B:可以直接发送8位字节数据，不需要使用Base64编码，从而减少了编码时间。
三、使用GIF-LZW压缩算法压缩图像。理由：
A:行程编码、Huffman压缩算法压缩率太低；
B:JPEG压缩算法需要太多位运算，且运算量大（有专门MMX优化算法），不利于VB实现；
C:GIF-LZW压缩算法压缩率较好，且我已想出VB语法下高效GIF-LZW压缩/解压算法。
四、使用“有序抖动”算法进行 色彩量化。理由：“有序抖动”处理的结果具有一定规律性，有助于LZW类算法压缩。-First, use the TCP protocol to transmit data. Reason: better stability.
Two, the use of byte data stream for transmission, the reasons:
A: VB s String existence automatic Unicode conversion question, effects of speed
B: can directly send 8-bit byte data, Does not need to use Base64 encoding, thereby reducing the encoding time.
Three, the use of GIF-LZW compression algorithm for image compression. Rationale:
A: Run-Length Coding, Huffman compression algorithm compression ratio is too low
B: JPEG compression algorithm required too many bit computing, and computing a large quantity (MMX has specialized optimization algorithm), VB is not conducive to implementation
C: GIF-LZW compression algorithm compression ratio is better, and I have come up with efficient under VB grammar GIF-LZW compression/decompression algorithm.
Four, use the "orderly jitter" algorithm for color quantization. Rationale: "orderly jitter" must deal with the results of reg
Platform: |
Size: 54272 |
Author: whoamixp |
Hits:
Description: 开源mp3解码库mad，许多公司都在用。-decoder.c
decoder.h
frame.c
frame.h
huffman.c
huffman.h
stream.c
stream.h
synth.c
synth.h
Platform: |
Size: 311296 |
Author: hdy |
Hits:
Description: classic huffman alg for data stream
Platform: |
Size: 14336 |
Author: hello |
Hits:
Description: 用于数据流压缩的huffman算法源代码,比较实用.-For data stream compression huffman algorithm source code, more practical.
Platform: |
Size: 16384 |
Author: 353 |
Hits:
Description: 根据Huffman编码方法的原理,实现建立Huffman树的功能.并自定义简单输入数据,检验结果.由键盘输入的任意字符流,输出显示每个字符的编码,并计算压缩比-According to the principle of Huffman encoding method to achieve the establishment of Huffman tree functions. And customize a simple input data, the test results. Of any character from the keyboard input stream, the output display each character encoding, and calculate the compression ratio
Platform: |
Size: 247808 |
Author: lienquan |
Hits:
Description: 此文档是研究关于JPEG哈夫曼编码二进制码流的详细分析，对于想研究JPEG码流如何编码的研究者将具有很大帮助。-This text tick is a search to admire the main huffman encode binary concerning JPEG code streaming of detailed analysis, for want to study the researcher whom the JPEG code flows how to code have to do a lot of good.
Platform: |
Size: 203776 |
Author: 黄立 |
Hits:
Description: 对于文件进行解压和压缩的哈弗曼编码，并对压缩文件以二进制流形式存储-For the file to decompress and compress the Ha Fuman coding, and compressed files are stored in binary stream
Platform: |
Size: 19456 |
Author: 许沙沙 |
Hits:
Description: 利用赫夫曼编码的实现原理码对数据进行无损压缩，设计一个实现Huffman压缩的编码和解码的程序。具体要求如下：读入待压缩的文本文件；
2）统计分析文本文件中各字符的出现频度，以频度作为构造Huffman树的权值。根据各字符出现的不同频度构造Huffman树，然后规定每种字符的Huffman编码。再次读入待压缩的文本文件，然后根据各字符的Huffman编码逐一替代，将得到的编码流写入到新的文件中，并且计算压缩率。
5）解码过程：先读入上一步骤得到的新文件，将其看作比特流，根据Huffman树，对比特流逐位译码，将解码结果又写入一个新的文件中。
-The principle use of Huffman coding for lossless compression of the data code to design an implementation of Huffman compression encoding and decoding process. Specific requirements are as follows: read the text file to be compressed 2) Statistical Analysis text file frequency of appearance of each character in frequency as the Huffman tree structure weights. According to the difference of the frequency of characters appear Huffman tree structure, and Huffman coding required for each character. Reads again the text file to be compressed, and then Huffman coding each character one by one alternative, the resulting encoded stream is written to the new file, and the calculated compression ratio. 5) decoding process: first step to get a read on the new file it as a bit stream, according to the Huffman tree for the bit-by-bit stream decoding, the decoded result has written to a new file.
Platform: |
Size: 1277952 |
Author: phoebe |
Hits:
Description: 1.基本上已经完成压缩及解压缩操作的代码实现。
解压缩时关键还是文件流的操作，读取内容时采用逐字节读取，把0－255的十进制整数转化为二进制数，利用这些二进制数从哈夫曼树的根结点出发，0走左子，1走右子，找到叶子结点，把该叶子结点的下标写入新文件，最后处理有效位数不满8位的字节-1 basically completed the compression and decompression code implementation.
Decompression is the key stream file operation, read the byte by byte read and the 0- 255 decimal integer transformation as a binary number, using the binary number starting the root node of the Huffman tree, 0 go left, 1 walk right, find a leaf node, the subscript of the leaf node is written to a new file, the effective number of bits 8 bits of the byte discontent
Platform: |
Size: 3072 |
Author: chenchen |
Hits: