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: 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: 2272 |
Author:亞男 |
Hits:
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:
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的压缩和编码分三个步骤:
1. 首先通过DCT变换去除数据冗余;
2. 使用量化表对DCT系数进行量化;
3. 对量化后的系数进行Huffman编码。-Realize the basic JPEG compression and encoding is divided into three steps: 1. First of all, through the DCT transform to remove data redundancy 2. The use of quantization table of quantization DCT coefficients 3. Quantization coefficients after Huffman coding. Platform: |
Size: 2048 |
Author:后果 |
Hits:
Description: 霍夫曼编译码,对数据文件中的字符进行统计,根据概率进行编码,并实现对数据文件压缩和解压缩过程-Huffman encoding and decoding of data files characters in statistics, according to the probability of encoding, and data files to achieve compression and decompression process Platform: |
Size: 5120 |
Author:董婷婷 |
Hits:
Description: 实现JPEG的压缩和编码
(1)首先通过DCT变换去除数据冗余;
(2)使用量化表对DCT系数进行量化;
(3)对量化后的系数进行Huffman编码。
-The realization of JPEG compression and coding (1) First of all, through the DCT transform to remove data redundancy (2) the use of quantization table of quantization DCT coefficients (3) of the coefficients after quantization Huffman coding. Platform: |
Size: 2048 |
Author:李雅 |
Hits:
Description: In computer science and information theory, Huffman coding is an entropy encoding algorithm used for lossless data compression Platform: |
Size: 4096 |
Author:hazhiriq200 |
Hits:
Description: 给予matlab的JPEG压缩程序,包含原始压缩图片,程序对灰度bmp图片进行JEPG编码,压缩成以0101形式的编码。JPEG编码先把图象色彩RBG变成亮度Y和色度Cr、Cb,它利用人的视觉对色度不敏感的特点,减少一部分色度数据,以达到压缩。 JPEG采取多种编码方式,包含有行程编码(Run Length Coding)和哈夫曼(Huffman)编码,有很高的压缩比。在编码前,先对数据进行分块,离散余弦变换(DCT)及量化,保留能量大的低频信号,丢弃高频信号以达到压缩。-Given to the JPEG compression matlab program, contains the original compressed image, the program of the grayscale bmp picture JEPG encoded, compressed into a 0101 form of encoding. RBG color coded JPEG image into a first luminance Y and chrominance Cr, Cb, which uses the human visual characteristics is not sensitive to the color, reduce the number of color data to achieve compression. Take a variety of JPEG encoding, includes length coding (Run Length Coding) and Huffman (Huffman) coding, a high compression ratio. In the code before the data block, discrete cosine transform (DCT) and quantization, to retain a large low-frequency signal energy, discarding high-frequency signals in order to achieve compression. Platform: |
Size: 175104 |
Author: |
Hits:
Description: 通信的数字化是它能与计算机技术和数字信号处理技术相结合的基础,而实现通信数字化的前提是信源能提供的各种用于传递的消息,例如语音、图像、数据、文字等都必须以数字化形式表示。而信源编码是数字通信系统中的重要组成部分,他是保证信号有效传输的一种重要方式。霍夫曼编码依据字符出现的概率来构造异字头的平均长度最短的码字,有时称之为最佳编码,其优越的性能被广泛使用在数字通信系统中。霍夫曼编码已经成为数据压缩的灵魂算法。本文介绍了无失真编码算法的构造,霍夫曼编码的规则和特点,同时分析了对信源进行优化的方法,最后通过MATLAB仿真来讨论比较二元霍夫曼编码、三元霍夫曼编码以及信源扩展编码的效率,来实现霍夫曼码的优化构造。-The digital communication is it can and computer technology and digital signal processing technology in combination of the base, and realize the digital communication is the premise of source can provide all kinds of used to deliver news, such as voice, video and data and text must take the digital form said. And the source coding digital communication system is the important component, he is to ensure the effective transmission signal is an important way. Huffman coding based on the probability of characters appear to construct different "the average length of the shortest code words, sometimes called the best coding, superior performance is widely used in digital communication system. Huffman coding has become the soul of data compression algorithm. This paper introduces the structure of the encoding algorithm without distortion, Huffman coding rules and characteristics, and analysis of the source of the optimization method, and finally by MATLAB simulation to discuss compares two yu Platform: |
Size: 59392 |
Author:郑华 |
Hits: