文档介绍：本科毕业设计(论文)
基于游程编码数据压缩算法的设计与实现
2013年6月
摘要
本次毕业设计主要是针对于游程编码数据压缩算法的设计与实现,游程编码非常简单,编码、解码速度快,应用广泛。游程编码是针对于二元序列的一种编码方法,对于二值图像而言是一种编码方法,对连续的黑、白像素数(游程)以不同的码字进行编码。游程编码是一种简单的非破坏性资料压缩法,其好处是加压缩和解压缩都非常快。其方法是计算连续出现的资料长度压缩之,其缺点是对于不重复的资料反而加大容量。游程编码即需大量的缓冲和优质信道,所以对数据游程编码后在进一步的进行哈夫曼编码已达到更完善的数据压缩。哈夫曼编码使用变长编码表对源符号进行编码,其中变长编码表是通过一种评估来源符号出现机率的方法得到的,出现机率高的字母使用较短的编码,反之出现机率低的则使用较长的编码,这便使编码之后的字符串的平均长度、期望值降低,从而达到无损压缩数据的目的。
本文主要介绍了信源编码的分类、获得最佳编码的方法、哈夫曼树的构建方法以及游程编码的原理和实现技术,对游程长度编码技术做了较为全面地研究。包括游程数据压缩、解压缩过程,并给出了流程图;哈夫曼数据压缩、解压缩过程,并给出流程图和结果图。
关键词游程编码哈夫曼编码压缩
Abstract
This graduation design is mainly based on run-length coding pression algorithm design and implementation of run-length coding is very simple, encoding and decoding speed, wide application. Run-length coding is a coding method for binary sequence, is a kind of coding method for binary image, the black and white pixels of continuous (run) in different code code word. Run-length coding is a kind of simple nondestructive pression method, the advantage is that pression and pression are very fast. Its method is to calculate a continuous length of pression, the downside is to not repeat data instead of increasing capacity. Run-length coding is need a lot of buffer and channel, so the data after the run-length coding in further Huffman encoding has reached more .
Source coding is mainly introduced in this paper the classification, the optimal method of coding, Huffman tree, construction methods, and the run-length coding principle and implementation technology, the length of the run-length encoding technology is done prehensive research. Including the run-length pression and pression process, and gives the flow chart; Huffman pression and pression process, chart and flow chart is given and the results.
Keywords Run-length coding Huffman encoding pression
目录
摘要 I
Abstract II
第1章绪论 1
课题背景 1
、意义 2
2
第2章信源编码分类 3
信源编码 3
3
3
4
4