Fast Directional Discrete Cosine Transforms Based Image Compression
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The traditional discrete cosine transform (DCT) can only sparsely represent the horizontal and vertical edges in images. The computation complexity of directional prediction DCT (DPDCT), which has the ability to represent more directions, is much higher. To overcome these shortcomings, the fast directional discrete cosine transforms (FDDCT) is proposed in this paper, in which the transformation is performed on the predefined direction mode. Compared with DPDCT, no interpolation is needed in FDDCT, so FDDCT can sparsely represent the anisotropic edges in much faster images. A special lifting algorithm is designed between adjacent blocks to ensure the perfect reconstruction, which compacts energy in edges lying across the blocks. The experimental results show that the computation of FDDCT is no more than 1.4 times that of DCT’s. Coding with the same set partition method, PSNR compressed images that are combined with FDDCT are 0.4~1.6dB higher than those with DCT and DPDCT. Also, the edges and the details in the images are much clearer and less distortion exists.

    Reference
    Related
    Cited by
Get Citation

陈波,王红霞,成礼智.图像压缩中的快速方向离散余弦变换.软件学报,2011,22(4):826-832

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 15,2009
  • Revised:July 06,2009
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063