A DCT Approximation for Image Compression

被引:122
作者
Cintra, Renato J. [1 ,2 ]
Bayer, Fabio M. [3 ]
机构
[1] Univ Fed Pernambuco, Dept Estat, Recife, PE, Brazil
[2] Univ Akron, Dept Elect & Comp Engn, Akron, OH 44325 USA
[3] Univ Fed Fronteira Sul, Erechim, Brazil
关键词
DCT approximation; image compression; low-complexity transforms; TRANSFORM;
D O I
10.1109/LSP.2011.2163394
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced. The proposed transformation matrix contains only zeros and ones; multiplications and bit-shift operations are absent. Close spectral behavior relative to the DCT was adopted as design criterion. The proposed algorithm is superior to the signed discrete cosine transform. It could also outperform state-of-the-art algorithms in low and high image compression scenarios, exhibiting at the same time a comparable computational complexity.
引用
收藏
页码:579 / 582
页数:4
相关论文
共 29 条
[1]  
[Anonymous], 2008, Functions of matrices: theory and computation
[2]  
[Anonymous], 2011, MATLAB
[3]  
Arai Y., 1988, Transactions of the Institute of Electronics, Information and Communication Engineers E, VE71, P1095
[4]   Image Compression Via a Fast DCT Approximation [J].
Bayer, F. M. ;
Cintra, R. J. .
IEEE LATIN AMERICA TRANSACTIONS, 2010, 8 (06) :708-713
[5]   Low-complexity 8 x 8 transform for image compression [J].
Bouguezel, S. ;
Ahmad, M. O. ;
Swamy, M. N. S. .
ELECTRONICS LETTERS, 2008, 44 (21) :1249-U30
[6]  
Bouguezel Saad, 2009, 2009 21st International Conference on Microelectronics (ICM 2009), P74, DOI 10.1109/ICM.2009.5418584
[7]  
BOUGUEZEL S, 2011, P 2011 IEEE INT S CI
[8]   A Novel Transform for Image Compression [J].
Bouguezel, Saad ;
Ahmad, M. Omair ;
Swamy, M. N. S. .
53RD IEEE INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, 2010, :509-512
[9]  
Bouguezel S, 2008, SCS: 2008 2ND INTERNATIONAL CONFERENCE ON SIGNALS, CIRCUITS AND SYSTEMS, P184
[10]  
Britanak V., 2007, Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations