计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (2): 181-183.DOI: 10.3778/j.issn.1002-8331.2010.02.054

• 图形、图像、模式识别 • 上一篇    下一篇

基于量化的二维DCT优化算法研究

李永亭,齐咏生,肖志云   

  1. 内蒙古工业大学 信息工程学院,呼和浩特 010051
  • 收稿日期:2008-07-28 修回日期:2008-09-25 出版日期:2010-01-11 发布日期:2010-01-11
  • 通讯作者: 李永亭

Fast algorithm of 2-D discrete cosine transform based on quantization

LI Yong-ting,QI Yong-sheng,XIAO Zhi-yun   

  1. College of Information Engineering,Inner Mongolia University of Technology,Huhhot 010051,China
  • Received:2008-07-28 Revised:2008-09-25 Online:2010-01-11 Published:2010-01-11
  • Contact: LI Yong-ting

摘要: DCT变换广泛应用于图像压缩算法中,在大多数情况下最有用的信息集中在DCT系数的低频序列中,而对那些经过量化后为零的系数进行计算,不但费时且计算量大幅增加。据此提出了两种新的二维DCT快速截取算法,使得计算一个8×8的二维DCT变换所需的乘法运算次数减少了60%,加法运算次数减少了77%。经过实验验证该算法在峰值信噪比PSNR值损失很少的情况下,显著地降低了算法的复杂度。

关键词: 离散余弦变换, 量化, 图像压缩

Abstract: The Discrete Cosine Transform(DCT) has become more and more popular in practical digital image process.In general,the most useful coefficients of the DCT concentrate in the low frequency orders.It is consuming time and increasing calculation for the calculation of zero coefficients.According to the characteristic of the quantized coefficients,two new optimized algorithms are proposed for the computation of a 2-D discrete cosine transform in this paper.The calculation of coefficients of a 8×8 DCT only need 32 multiplications and 108 additions.The total number of multiplications is reduced 60%,and the total number of additions is reduced 77%.The results show that for practical situations,significant computation reductions can be achieved while causing negligible PSNR degradation.

Key words: Discrete Cosine Transform(DCT), quantization, image compression

中图分类号: