Low-complexity 8 x 8 transform for image compression

被引:79
作者
Bouguezel, S. [1 ]
Ahmad, M. O. [2 ]
Swamy, M. N. S. [2 ]
机构
[1] Univ Setif, Dept Elect, Fac Engn, Setif 19000, Algeria
[2] Concordia Univ, Dept Elect & Comp Engn, Montreal, PQ H3G 1M8, Canada
关键词
D O I
10.1049/el:20082239
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An efficient 8 x 8 sparse orthogonal transform matrix is proposed for image compression by appropriately introducing some zeros in the 8 x 8 signed discrete cosine transform (SDCT) matrix. An algorithm for its fast computation is also developed. It is shown that the proposed transform provides a 25% reduction in the number of arithmetic operations with a performance in image compression that is much superior to that of the SDCT and comparable to that of the approximated discrete cosine transform.
引用
收藏
页码:1249 / U30
页数:2
相关论文
共 6 条
[1]   DEVELOPMENT OF INTEGER COSINE TRANSFORMS BY THE PRINCIPLE OF DYADIC SYMMETRY [J].
CHAM, WK .
IEE PROCEEDINGS-I COMMUNICATIONS SPEECH AND VISION, 1989, 136 (04) :276-282
[2]   Multiplication-free 8x8 2D DCT architecture using algebraic integer encoding [J].
Dimitrov, V ;
Wahid, K ;
Jullien, G .
ELECTRONICS LETTERS, 2004, 40 (20) :1310-1311
[3]   SCALED DCTS ON INPUT SIZES THAT ARE COMPOSITE [J].
FEIG, E ;
LINZER, E .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1995, 43 (01) :43-50
[4]   A new square wave transform based on the DCT [J].
Haweel, TI .
SIGNAL PROCESSING, 2001, 81 (11) :2309-2319
[5]   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
[6]   The BinDCT: Fast multiplierless approximation of the DCT [J].
Tran, TD .
IEEE SIGNAL PROCESSING LETTERS, 2000, 7 (06) :141-144