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: 数字图像处理实验
根据原图像的直方图，发现背景和目标的分割值大约在130左右，并将灰度图像转为二值图像，分割效果比较理想。
图像处理实验（六）图像压缩与编码
实验目的： 学习JPEG压缩编码
实验内容：
一．实现基本JPEG的压缩和编码分三个步骤：
1． 首先通过DCT变换去除数据冗余；
2． 使用量化表对DCT系数进行量化；
3． 对量化后的系数进行Huffman编码。-digital image processing experiments based on the original image histogram, found background and objectives of the divided about the value of around 130 and two gray-scale image to image, Segmentation more satisfactory results. Image processing experiments (6) Image Compression and Coding of the experiment : Learning JPEG compression coding experiment : one. Basically JPEG compression and coding in three steps : 1. First through DCT remove data redundancy; 2. Using quantitative table right DCT coefficient quantization; 3. Right quantized coefficients of Huffman coding. Platform: |
Size: 4096 |
Author:qq |
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: jpeg压缩的matlab程序，包括分块，量化，霍夫曼编码，其中量化和霍夫曼编码用查表实现，提高速度。-jpeg compression matlab procedures, including block, quantization, Huffman coding, in which quantization and Huffman coding using look-up table to achieve, improve the speed. Platform: |
Size: 1118208 |
Author:ronghy |
Hits:
Description: ) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
-) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
Platform: |
Size: 1024 |
Author:ria |
Hits:
Description: Codes".
Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.-Codes".
Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.
Platform: |
Size: 1024 |
Author:muhammad |
Hits:
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:
Description: 哈夫曼码编码用MATLAB实现，此法经过检验效果非常好。-Huffman coding using MATLAB implementation, this method is proven very successful. Platform: |
Size: 34816 |
Author:李强 |
Hits:
Description: 利用Matlab编程实现对lena.bmp灰度图象进行QF=50和QF=40的压缩和解压缩，比较二者的PSNR，并且利用霍夫曼编码模拟信道中传输图象。通过了Matlab2009A测试。-Using Matlab program to compress and decompress the gray image Lena.bmp at QF = 50 and QF = 40,as well as comparing the result of two situation.Then using Huffman coding analog channels transmitted images. Adopted Matlab2009A test. Platform: |
Size: 2048 |
Author:Alex |
Hits:
Description: 这是我自己用MATLAB编写的一个源程序，是保存在WORD里面的，里面有源程序和实验步骤，可以下载下来实验，大家也可以对这个程序进行改进-This is my own written using MATLAB source is saved in WORD inside source and experimental steps, which can be downloaded experiments, we can improve this program Platform: |
Size: 8192 |
Author:wangshanshan |
Hits:
Search - huffman coding using matlab