外文文献—数字图像压缩技术介绍

1、附录附录idigital image compressiondigital image compression, also known as image compression or image coding is divided into still image compression and motion image compression (video compression). there is a high degree of correlation in the image data, an image of internal and video images between a

2、lot of redundant information. redundant information including the following five: (1) time redundancy: the difference between adjacent frames of the image sequence is very small, this time redundancy is called temporal redundancy. (2) spatial redundancy: an image internal uniform coloring part, or t

3、he images within the regular pattern, this space-related redundancy is known as spatial redundancy. (3) structural redundancy: in strong texture, or between the various parts of the image there is a certain relationship, such as self-similarity in the part of the image area memory. this redundancy i

4、s called structural redundancy. (4) the redundancy of knowledge: the information contained in the image and some basic knowledge of a priori, such as in the general face images, the mutual position of the head, eyes, nose and mouth is some common sense. this redundancy is called knowledge redundancy

5、. (5) visual redundancy: in most cases, the ultimate recipients of the reconstructed image is the human eye. in order to achieve higher compression ratio, you can use the characteristics of the human visual system. for example, the human eye, the ability to distinguish different colors, the sensitiv

6、ity of different directions. therefore, if the encoding scheme is the use of some of the features of the human visual system, can further improve the compression ratio and image of the so-called subjective quality. image coding is possible to remove redundant information of the various forms in orde

7、r to reduce the number of bits representing the image required commonly used in image compression methods are the following:1, the run length encoding (rle) length encoding (run-length encoding) is one of the easiest way to compress a file. its approach is a series of duplicate values (for example,

8、the gray values of image pixels) with a single value plus a count value to replace. for example, there is such a letter sequence aabbbccccccccdddddd the stroke length encoding is 2a3b8c6d. this method is very easy to implement, but also for string compression with long repeated values。the coding is

9、very effective. for example, there are large areas of continuous shadow or the image of the same color, using this method pressure。reduction effect of a good. many bitmap file formats with a run length encoding, such as tiff, pcx, gem.2, the lzw coding this is the abbreviation of the name of three i

10、nventors (the lempel, ziv, welch), its principle is that each one byte the value should be paired with the value of the next byte is a character, and set a code for each character. when the same kind of a character on the re-emergence of code instead of this character pair, then this code and the ne

11、xt character matching. lzw coding principle is an important feature, the code is not only able to replace a bunch of the same value of the data, but also be able to replace.a bunch of different data values. if some of the different data values in the image data is often repeated, can also be found a

12、 code to replace the data string. in this regard, the lzw compression principle is better than rle.3, huffman coding huffman coding (huffman encoding) instead of the original data is not fixed length coding to achieve. huffman coding was first established, in order to compress the text file and so f

13、ar has been a lot of change body. its basic idea is the frequency the higher the value, the shorter the length of its corresponding coding, on the contrary the frequency of the more low values, the corresponding coding length. huffman coding rarely achieve 8:1 compression ratio, in addition, it also

14、 has the following two problems: the it must be refined indeed the statistics of the frequency of occurrence of each value in the original document, if not this precise statistics, the effect of compression on will be greatly reduced, or even less than the compression effect. huffman coding is usual

15、ly to go through twice the operation, the first over the statistics, the second time the code, the encoding process is relatively slow. in addition, due to various length,encoded in the decoding process is relatively complex, so the extraction process is relatively slow. it is more sensitive. huffma

16、n coding all together regardless of byte sub, so increase plus one, or reduce one will make the decoding results beyond recognition.4, prediction and interpolation coding usually in the local region in the image pixels are highly correlated, so using the previous pixel gray expected degree of knowle

17、dge of the current pixel gray, which is forecast. the so-called interpolation is based on previous and pixel gray-scale knowledge to infer the current pixel grayscale. if the prediction and interpolation is correct,do not have to compress each pixel gray, but the difference between the predicted val

18、ue and the actual pixel values after entropy coded and sent to the receiving end. predictive value and the difference signal to reconstruct the original pixel in the receiving end.predictive coding can be obtained relatively high coding quality, and relatively simple to achieve, which is widely used

19、 in image compression coding system. but its compression ratio is not high, and accurate prediction depends on the image special.of a priori knowledge, and must make a large number of non-linear operation, it is generally not used alone, but used in combination with other methods. such as predictive

20、 coding in jpeg dct dc coefficient the encoding of the exchange coefficient is used to quantify the + rle + huffman coding.5, vector quantization coding vector quantization encoding the high correlation between adjacent image data, the input image data sequence grouping,each set of m data constitute

21、 an m-dimensional vector, is encoded together, that is, to quantify more than once. according to the shannon rate, distortion theory for memoryless sources, the vector quantization coding is always better than scalar quantization coding.before coding, first by the large number of samples of the trai

22、ning or learning, or self-organizing feature map neural network, get a series of standard image mode, each image pattern is called a codeword or code vector, these codewords or code vectors together.together are called the codebook, the codebook is actually a database. the input image block in accor

23、dance with a certain way to form an input vector. encoding this input vector and all codewords of the code book to calculate the distance to find the nearest codeword, that is to find the best matching image block. the output index (address) as the encoding results. decoding process is the opposite.

24、 according to the coding results of the index from the code book to find the index corresponding to code word (the code book and codingcodebook), constitute the decoding result. therefore, vector quantization coding is a lossy codec. at present the use of more,the multi-vector quantization coding sc

25、heme is a random vector quantization, the transform domain vector quantization, finite state vector quantization, the address vector quantization waveform gain vector quantization, classified vector quantization, and prediction vector quantization.6, transform coding transform coding image intensity

26、 matrix (time-domain signal) transform to the coefficient space (frequency domain signal) motivated line processing method. has a strong signal in space, reflected in the frequency domain within certain areas.the amount is often together, or the distribution of the coefficient matrix with some regul

27、arity. we can use these rules,law to reduce the number of quantization bits in the frequency domain, to achieve the purpose of compression. as the transformation matrix of orthogonal transformation is reversible .inverse matrix transpose matrix are equal, which makes the decoding operation is the so

28、lvability of operator convenience, so the operational matrix of the total is the choice of the orthogonal transform to do.commonly used transform coding k-l transform coding and dct coding. k-l transform coding in compression ratio is superior to dct coding, but the large amount of computation and t

29、here is no fast algorithm for dct coding is widely used in practical application.7, the model law coding predictive coding, vector quantization coding and transform coding is a waveform coding, its theoretical foundation is a signal processor.theory and information theory; starting point is the imag

30、e signal as irregular statistical signal from the correlation between pixels.this image signal statistical model starting the design of the encoder. model coding is the use of computer vision and computer graphics analysis and synthesis of knowledge on the image signal.model coding the image signal

31、as the target and scene projection in the 3d world to the product of the two-dimensional plane, while evaluation of the product is determined by the characteristics of the human visual system. model encoded key is a particular graph.like model, and according to this model to determine the characteri

32、stic parameters of the image of the scene, such as motion parameters, shape parameters.and so on. decoding according to the parameters and known model synthesis image reconstruction of images. encoded object is a specialsign parameters, instead of the original image, it is possible to achieve relati

33、vely large compression ratio. the error introduced by the model coding is less sensitive to the human visual geometric distortion, the reconstructed image is very natural and realistic. in addition, in recent years, fractal coding coding and wavelet transform techniques and an increasing number of a

34、pplications in image compression.reduction of the field, but most are still in the research stage, still in front of the common image compression method described in the main. of course, in actual applications, a variety of image compression methods are often combined to use, such as jpeg.数字图像压缩技术介绍

35、 数字图像压缩又称为图像压缩或图像编码，分为静止图像压缩和运动图像压 缩（视频压缩）。由于图像数据中存在着高度的相关性，一幅图像内部及视频图 像之间存在大量的冗余信息。这些冗余信息主要包括以下五种：（1）时间冗余：图像序列的相邻帧之间差别很小，这种与时间相关的冗余称为时间冗余。（2）空间冗余：一幅图像内部存在均匀着色的部分，或者图像内部存在规则的模式，这种与空间相关的冗余称为空间冗余。（3）结构冗余：在图像的部分区域内存在着较强的纹理结构，或者图像的各部分之间存在着某种关系，如自相似性。这种冗余称为结构冗余。（4）知识冗余：图像中包含的信息与某些先验的基础知识有关，如在一般的人脸图像中，头、眼

36、、鼻和嘴的相互位置等信息就是一些常识。这种冗余称为知识冗余。（5）视觉冗余：在多数情况下，重建图像的最终接受者是人的眼睛。为了达到较高的压缩比，可以利用人类视觉系统的特点。比如人眼对不同颜色的分辨能力不同，对不同方向的敏感度也不同等等。因此，如果编码方案利用人类视觉系统的一些特点，可以进一步提高压缩比和图像的所谓主观质量。图像编码就是要尽可能的去除上述各种形式的冗余信息，以降低表示图像所需的比特数。常用的图像的压缩方法有以下几种： 1、行程长度编码（rle） 行程长度编码（run-length encoding）是压缩一个文件最简单的方法之一。它的做法就是把一系列的重复值（例如图象像素的灰度值

37、）用一个单独的值再加上一个计数值来取代。比如有这样一个字母序列aabbbccccccccdddddd它的行程长度编码就是2a3b8c6d。这种方法实现起来很容易，而且对于具有长重复值的串的压缩编码很有效。例如对于有大面积的连续阴影或者颜色相同的图象，使用这种方法压缩效果很好。很多位图文件格式都用行程长度编码，例如tiff，pcx，gem等。 2、lzw编码 这是三个发明人名字的缩写（lempel，ziv，welch），其原理是将每一个字节的值都要与下一个字节的值配成一个字符对，并为每个字符对设定一个代码。当同样的一个字符对再度出现时，就用代号代替这一字符对，然后再以这个代号与下个字符配对。 l

38、zw编码原理的一个重要特征是，代码不仅仅能取代一串同值的数据，也能够代替一串不同值的数据。在图像数据中若有某些不同值的数据经常重复出现，也能找到一个代号来取代这些数据串。在此方面，lzw压缩原理是优于rle的。 3、霍夫曼编码 霍夫曼编码（huffman encoding）是通过用不固定长度的编码代替原始数据来实现的。霍夫曼编码最初是为了对文本文件进行压缩而建立的，迄今已经有很多变体。它的基本思路是出现频率越高的值，其对应的编码长度越短，反之出现频率越低的值，其对应的编码长度越长。 霍夫曼编码很少能达到81的压缩比，此外它还有以下两个不足：它必须精确地统计出原始文件中每个值的出现频率，如果没有

39、这个精确统计，压缩的效果就会大打折扣，甚至根本达不到压缩的效果。霍夫曼编码通常要经过两遍操作，第一遍进行统计，第二遍产生编码，所以编码的过程是比较慢的。另外由于各种长度的编码的译码过程也是比较复杂的，因此解压缩的过程也比较慢。 它对于位的增删比较敏感。由于霍夫曼编码的所有位都是合在一起的而不考虑字节分位，因此增加一位或者减少一位都会使译码结果面目全非。 4、预测及内插编码 一般在图象中局部区域的象素是高度相关的，因此可以用先前的象素的有关灰度知识来对当前象素的灰度进行预计，这就是预测。而所谓内插就是根据先前的和后来的象素的灰度知识来推断当前象素的灰度情况。如果预测和内插是正确的，则不必对每一个象素的灰度都进行压缩，而是把预测值与实际象素值之间的差值经过熵编码后发送到接收端。在接收端通过预测值加差值信号来重建原象素。 预测编码可以获得比较高的编