节点文献

基于上下文的图像压缩技术研究

Research of the Image Compression Based on Context

【作者】 邢艳

【导师】 焦李成;

【作者基本信息】 西安电子科技大学 , 电路与系统, 2010, 硕士

【摘要】 随着数字通信、多媒体技术的飞速发展,图像压缩编码已成为信号传输及存储中的一个关键环节。目前数字图像压缩编码方法的种类繁多,近些年,基于上下文的图像压缩算法成为一个新的研究热点,它因能获得高的压缩性能、好的重构质量而在图像压缩领域受到广泛应用。本文对基于上下文的图像压缩算法做了进一步的研究,主要包括以下几方面的工作:首先,本文针对目前基于下采样的压缩方法中存在的复杂度高及边缘重构质量差的问题,提出了一种低码率下基于自适应下采样和交叠变换的图像压缩方法,在编码端根据图像的DCT变换系数自适应地选择图像的平滑区域下采样,而在解码端使用简单的Cubic插值重构被下采样的平滑区域。另外,考虑到DCT变换只能去除块内的相关性,我们加入了交叠变换以去除块间的相关性。实验结果表明,该算法不仅具有高的压缩性能并且拥有低的复杂度。其次,针对传统的四叉树编码方法使用固定的编码浏览顺序及相等长度的码字表示一个重要块,本文提出了带有上下文权值和率失真优化的可变长图像编码方法,能够根据建立的上下文权值预测模型估计子块的重要性程度,调整子块的编码顺序,从而得到一种有效的可变长编码。另外,可利用上下文权值对率失真进行优化,使重要信息能被尽早编码,以进一步改善压缩性能。最后,本文提出了一种带有基于上下文的反量化技术的图像编码方法,在解码端能够根据前边已经解码出来的系数估计变换系数的分布情况,按照估计出来的分布曲线寻找待解码系数的最佳重建点,从而避免使用均值量化器。文中所提出的基于上下文的反量化技术使我们的压缩方法满足一种非对称的压缩方案,保持编码端的复杂度不变,而在计算能力更强的解码端采用更高复杂度的反量化器代替均值量化器,以提高整体的压缩性能。

【Abstract】 With the rapid development of digital communication and multimedia technology, image compression has played an important role in signal transmission and storage. At present, there are many kinds of image compression. In recent years, the compression method based on context has become a new study point. This method is greatly used in the field of image compression because of its high compression performance and clear restored image.In this dissertation, the further research about the image compression based on context is made. It includes the following three aspects.Firstly, in order to improve the drawbacks of the current downsample-based compression having high complexity and bad reconstruction for edge region, we propose an image compression with adaptive downsampling and lapped transform at the low bit rates. At the encoder side, codec can choose adaptively the smooth area of images to downsample according to the DCT coefficients; and at the decoder side, codec uses simple Cubic interpolation to restore the downsampled area. In addition, in view of that DCT can not remove the cross-block correlation, so lapped transform is adopted in this new method. Experimental results show that the method has not only the high compression performance but also the low complexity.Secondly, aimed at the problem that the conventional quad-tree coding uses fixed scanning order and equal-length bit to code a significant block, a new variable-length quad-tree coding method with context weight and rate-distortion optimization is proposed in this paper. The method can adjust the scanning order of sub-blocks using their significance degrees which are predicted by the proposed context weight model, and spend different-length bits to represent different cases. In addition, the context weight model can also be used in rate-distortion optimization in order to further improve the compression performance.Finally, we propose a new image coding method with inverse quantization method based on context. This method is to estimate the distribution of transformed coefficients by the coefficients which have been decoded at the decoder side, and then find the optimal reconstructed point of the coefficients that will be decoded using the estimated distribution of transformed coefficients. This method makes us avoid using mean quantizer. With the inverse quantization technology based on context, our coding system satisfies a dissymmetrical compression scheme which keeps the complexity of the encoder invariable and uses the complex quantization method at the decoder side that has powerful computational ability to increase the compression performance.

节点文献中: 

本文链接的文献网络图示:

本文的引文网络