Image Compression Via a Fast DCT Approximation

被引:20
作者
Bayer, F. M. [1 ,2 ]
Cintra, R. J.
机构
[1] Univ Fed Fronteira Sul, Erechim, RS, Brazil
[2] Univ Fed Pernambuco, Programa Posgrad Estat, Recife, PE, Brazil
关键词
discrete cosine transforms; fast algorithms; image coding; complexity theory; COMPUTATION;
D O I
10.1109/TLA.2010.5688099
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Discrete transforms play an important role in digital signal processing. In particular, due to its transform domain energy compaction properties, the discrete cosine transform (DCT) is pivotal in many image processing problems. This paper introduces a numerical approximation method for the DCT based on round-off techniques. The proposed method is a multiplierless technique with low arithmetic complexity. Emphasis was given to approximating the 8-point DCT. A fast algorithm for the introduced 8-point approximate transform was derived. An application in image compression was examined. In several scenarios, the utilization of the proposed method for image compression resulted in comparable or better performances, when compared to the usual DCT-based methodology.
引用
收藏
页码:708 / 713
页数:6
相关论文
共 21 条
[1]   DISCRETE COSINE TRANSFORM [J].
AHMED, N ;
NATARAJAN, T ;
RAO, KR .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (01) :90-93
[2]  
[Anonymous], USC SIPI IM DAT
[3]  
[Anonymous], 1977, DISCRETE TIME SIGNAL
[4]  
Blahut R.E., 1985, FAST ALGORITHMS DIGI
[5]  
Blanchet Gerard., 2006, Digital SIgnal and Image Processing using Matlab
[6]  
Briggs WL, 1995, The DFT: An Owner's Manual for the Discrete Fourier Transform
[7]   RELATION BETWEEN THE KARHUNEN LOEVE AND COSINE TRANSFORMS [J].
CLARKE, RJ .
IEE PROCEEDINGS-F RADAR AND SIGNAL PROCESSING, 1981, 128 (06) :359-360
[8]  
Coppersmith Don, 1987, P 19 ANN ACM S THEOR, P1
[9]  
FEIG F, 1992, IEEE T SIGNAL PROCES, V40
[10]  
FERNANDEZ PJ, 2002, MEDIDA INTEGRACAO