CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - entropy data
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - entropy data - List
[
Compress-Decompress algrithms
]
Huffman_mfc
DL : 0
哈夫曼编码,基于MFC开发。哈夫曼编码为熵编码中的最佳方法之一,广泛用于各种数据压缩技术中。-Huffman coding, based on the MFC. Huffman coding for entropy coding one of the best ways, for a wide variety of data compression technology.
Date
: 2008-10-13
Size
: 197.02kb
User
:
canny06
[
Compress-Decompress algrithms
]
huff0645345
DL : 0
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.
Date
: 2008-10-13
Size
: 24.81kb
User
:
金金
[
Compress-Decompress algrithms
]
Huffman_mfc
DL : 0
哈夫曼编码,基于MFC开发。哈夫曼编码为熵编码中的最佳方法之一,广泛用于各种数据压缩技术中。-Huffman coding, based on the MFC. Huffman coding for entropy coding one of the best ways, for a wide variety of data compression technology.
Date
: 2025-12-26
Size
: 197kb
User
:
canny06
[
Compress-Decompress algrithms
]
huff0645345
DL : 0
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.
Date
: 2025-12-26
Size
: 25kb
User
:
金金
[
Compress-Decompress algrithms
]
9854125413
DL : 0
运动估计是视频编码的关键技术,其最基本的原理是利用相邻帧间的时间 相关性,通过预测来减少时间冗余度。在实际编码中,为了节省码率,并不传 输每一帧的全部数据,而是利用运动估计求出每一帧与其预测参考帧之间的差 值。运动估计越准确,差值的分布越趋近与零,差值块的能量越小,经过变换、 量化和熵编码后所产生的码流的比特位率也越少。因此,运动估计搜索的准确 程度直接影响到了编码的压缩性能。 -Motion estimation is the key to video encoding technology, its basic principle is the use of the adjacent time frame relevant, through the forecast period to reduce redundancy. In the actual code, in order to save bit rate and does not transfer all the data of each frame, but the use of motion estimation for each frame obtained with the prediction of the difference between the reference frame. Motion estimation more accurate, more closer to the margin and the distribution of zero, the smaller the energy difference between blocks, after transform, quantization and entropy coding of the code produced by the bit stream bit rate is less. Therefore, the motion estimation search accuracy of the direct impact on the performance of the compression coding.
Date
: 2025-12-26
Size
: 17kb
User
:
罗鹏
[
Compress-Decompress algrithms
]
SUANSHU
DL : 0
本文由香农熵理论和统计编码的原理开始,逐步展开对基于算术编码的数据压缩的研究与应用的讨论:从算术编码的原理、产生条件、以及研究算术编码的目的意义等,到具体算术编码方案的分析比较以及其C++语言的实现方案-This Yuka agricultural entropy coding theory and statistical theory began to gradually expand the data based on arithmetic coding compression research and application of the discussion: from the principle of arithmetic coding, production conditions, and the purpose of meaning of arithmetic coding, arithmetic coding to the specific analysis and comparison of the program and its implementation of C++ language programs
Date
: 2025-12-26
Size
: 49kb
User
:
杜秋国
[
Compress-Decompress algrithms
]
entropy-encoding
DL : 0
视频信号熵编码源程序 熵编码法是一种进行无损数据压缩的技术,在这个技术中一段文字中的每个字母被一段不同长度的比特(Bit)所代替。与此相对的是LZ77或者LZ78等数据压缩方法,在这些方法中原文的一段字母列被其它字母取代。 每个字母按照其出现的可能性所获得的最佳比特数取决于熵。 本程序不仅提供源程序,还提供相应的实例。-Entropy coding the video signal source for entropy coding method is a lossless data compression technology in the technology section of the text in each letter is a bit different lengths (Bit) replaced. In contrast the LZ77 or LZ78 data compression method, etc., in these methods section of the original letters column is replaced by other letters. Each letter appears in accordance with its possibilities to obtain the optimal number of bits depends on the entropy. This procedure provides not only source, but also provide examples.
Date
: 2025-12-26
Size
: 280kb
User
:
安慰安防
[
Compress-Decompress algrithms
]
arithmetic
DL : 0
算术编码是信源编码中的一种,是图像压缩的主要算法之一。 是一种无损数据压缩方法,也是一种熵编码的方法。-Arithmetic coding is a source coding, image compression is one of the main algorithms. Is a lossless data compression method, but also a method of entropy coding.
Date
: 2025-12-26
Size
: 1kb
User
:
zhangli
[
Compress-Decompress algrithms
]
1HUFFMANN
DL : 0
Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol. It was developed by David A. Huffman while he was a Ph.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes".
Date
: 2025-12-26
Size
: 1kb
User
:
Abirami
[
Compress-Decompress algrithms
]
xinxi
DL : 0
哈夫曼编码,基于MFC开发。哈夫曼编码为熵编码中的最佳方法之一,广泛用于各种数据压缩技术中。-Huffman coding, based on the MFC. Huffman coding for entropy coding one of the best ways, for a wide variety of data compression technology.
Date
: 2025-12-26
Size
: 1.79mb
User
:
chenxin
[
Compress-Decompress algrithms
]
HuffCode
DL : 0
Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol. It was developed by David A. Huffman while he was a Ph.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes
Date
: 2025-12-26
Size
: 1kb
User
:
yashika
[
Compress-Decompress algrithms
]
Huffman
DL : 0
Huffman编码的主导思想是根据数据符号发生的概率进行编码。在源数据中出现概率越高的符号,相应的码长越短;出现概率越小的符号,其码长越长,从而达到用尽可能少的码符号表示源数据。Huffman编码方法是接近压缩比上限的一种最佳的编码方法。-The dominant idea of the Huffman coding is based on the probability of occurrence of data symbols for encoding.The higher the probability that the symbol appears in the source data and the corresponding code length is shorter smaller probability symbols, the code length is longer, so as to achieve as little as possible code symbols indicates that the source data. Huffman encoding method is close to the compression than the upper limit of an optimal encoding method.reduce the temporal redundancy, DCT technology to reduce the the image spatial redundancy, the use of entropy coding aspects reduce the informationa statistical redundancy. The integrated use of several techniques, which greatly enhanced the compression performance.
Date
: 2025-12-26
Size
: 2kb
User
:
张怡然
[
Compress-Decompress algrithms
]
Data_Compress_System
DL : 0
各种数据压缩和解压的源码,用mfc实现。包括熵编码,预测编码,变换编码,字典编码- 是作为论文参考,和学习解压缩解压的完美代码。-The source of a variety of data compression and decompression, with mfc achieved. Entropy coding, predictive coding, transform coding, dictionary coding- as reference papers, and learning Solutions compression decompression perfect code.
Date
: 2025-12-26
Size
: 15.82mb
User
:
liz
[
Compress-Decompress algrithms
]
Arithmatic
DL : 0
arithmatic 编码,是图像压缩的主要算法之一,是一种无损数据压缩方法,也是一种熵编码的方法。-arithmatic coding is one of the main image compression algorithm and a lossless data compression method, but also a method of entropy coding.
Date
: 2025-12-26
Size
: 11kb
User
:
zzl
[
Compress-Decompress algrithms
]
arithcode
DL : 0
Arithmetic coding is a form of entropy encoding used in lossless data compression. Normally, a string of characters such as the words "hello there" is represented using a fixed number of bits per character, as in the ASCII code. When a string is converted to arithmetic encoding, frequently used characters will be stored with fewer bits and not-so-frequently occurring characters will be stored with more bits, resulting in fewer bits used in total. Arithmetic coding differs from other forms of entropy encoding such as Huffman coding in that rather than separating the input into component symbols and replacing each with a code, arithmetic coding encodes the entire message into a single number, a fraction n where (0.0 ≤ n < 1.0).
Date
: 2025-12-26
Size
: 1kb
User
:
bhushan
[
Compress-Decompress algrithms
]
buildHuffmanTree
DL : 0
霍夫曼编码是一种编码方式,是一种用于无损数据压缩的熵编码(权编码)算法。用变长编码表对源符号(如文件中的一个字母)进行编码,其中变长编码表是通过一种评估来源符号出现机率的方法得到的,出现机率高的字母使用较短的编码,反之出现机率低的则使用较长的编码,这便使编码之后的字符串的平均长度、期望值降低,从而达到无损压缩数据的目的。-Huffman coding is a coding is a lossless data compression entropy coding (right coding) for the algorithm. With variable-length coding tables on the source symbol (such as a file in a letter) to encode, which is a method of variable length coding table through an assessment of the probability of occurrence of the source symbols obtained letters appear high probability using a shorter code, and vice versa low appears machine code using a longer, which would make the average length of the string after encoding, expectations are lower, so as to achieve the purpose of lossless data compression.
Date
: 2025-12-26
Size
: 1kb
User
:
lly
[
Compress-Decompress algrithms
]
LZ编码
DL : 0
LZ 系列算法用一种巧妙的方式将字典技术应用于通用数据压缩领域,而且,可以从理论上证明LZ 系列算法同样可以逼近信息熵的极限。 实现LZ算法且实现GUI界面(The LZ series algorithm uses a clever way to apply the dictionary technology to the general data compression field. Moreover, it can theoretically prove that the LZ series algorithm can also approximate the limit of information entropy. Implement the LZ algorithm and implement the GUI interface)
Date
: 2025-12-26
Size
: 70kb
User
:
花零。
[
Compress-Decompress algrithms
]
熵值法
DL : 1
此压缩文件里面包含面板数据熵值法的stata代码,每一步都有详细的解释,并且附有样本和数据,方便学者理解和掌握。(This compressed file contains the stat a code of panel data entropy method, each step has a detailed explanation, and is attached with samples and data, which is convenient for scholars to understand and master.)
Date
: 2025-12-26
Size
: 91kb
User
:
tt12
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.