图像处理课程设计熵编码研究.docVIP

图像处理课程设计报告熵编码研究 Abstract Huffman coding is a way of Huffman coding is a variable word length coding (VLC) of the kind. Huffman coding in 1952 proposed a method based on the character completely different probability to construct the shortest average length of prefix code words, sometimes called the best code, generally known as Huffman coding. ─ the optimal Huffman tree to tree, the right path with the minimum length of binary trees, often used in data compression. Information processing in the computer, Huffman coding is a consistency of coding method (also known as entropy coding method) for lossless data compression. The term refers to the use of a specific character encoding table source (for example, a symbol of a file) for encoding. This code table is special because it is based on characters appear each source estimates the probability of the set up (with high probability using a shorter encoding of characters, otherwise there is a low probability of the use of longer codes, which the encoded string will be the average expected length of the lower, so as to achieve the purpose lossless data compression). This method is developed by the David.A.Huffman. For example, in English, e the probability is high, and z, the lowest probability. When using Huffman compression on the one conducted in English, e is likely to use a bit (bit) to represent, and z may be spent in 25-bit (not 26). The ordinary representation, each letter occupies one byte are (byte), or 8 bits. Compared the two, e use of a general code of 1 / 8 length, z is used 3 times. If we can achieve all the English letters in the probability of more accurate estimates can dramatically improve the lossless compression ratio. Entropy coding methods, and other difference is that, other entropy coding methods are usually divided into the input message symbol, and then encode each symbol, and arithmetic coding is the message directly to the input code as a number, a meet (0.0 ≤ n 1.0) fractional n. In a