DCT-like transform for image compression requires 14 additions only

被引：70

作者：

Bayer, F. M. ^{[1
]}

Cintra, R. J. ^{[2
,3
]}

机构：

[1] Univ Fed Santa Maria, Dept Estat, Santa Maria, RS, Brazil

[2] Univ Fed Pernambuco, Recife, PE, Brazil

[3] Univ Akron, Akron, OH 44325 USA

来源：

ELECTRONICS LETTERS | 2012年 / 48卷 / 15期

关键词：

Image compression - Approximation algorithms;

D O I：

10.1049/el.2012.1148

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A low-complexity 8-point orthogonal approximate discrete cosine transform (DCT) is introduced. The proposed transform requires no multiplications or bit-shift operations. The derived fast algorithm requires only 14 additions, less than any existing DCT approximation. Moreover, in several image compression scenarios, the proposed transform could outperform the well-known signed DCT, as well as state-of-the-art algorithms.

引用

页码：919 / 921

页数：3

共 10 条

[1]

[Anonymous], ELECT LETT

[2]

[Anonymous], 2009, 2009 INT C MICR ICM

[3]

[Anonymous], USC SIPI IM DAT

[4] 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

[5]

BOUGUEZEL S, 2011, P 2011 IEEE INT S CI

[6]

Brahimi N., 2011, 2011 7th International Workshop on Systems, Signal Processing and their Applications (WOSSPA 2011), P71, DOI 10.1109/WOSSPA.2011.5931415

[7]

Britanak V., 2007, Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations

[8] A DCT Approximation for Image Compression [J].

Cintra, Renato J. ;

Bayer, Fabio M. .

IEEE SIGNAL PROCESSING LETTERS, 2011, 18 (10) :579-582

[9] A new square wave transform based on the DCT [J].

Haweel, TI .

SIGNAL PROCESSING, 2001, 81 (11) :2309-2319

[10] Scalable variable complexity approximate forward DCT [J].

Lengwehasatit, K ;

Ortega, A .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2004, 14 (11) :1236-1248

← 1 →