摘要
本文介绍了二维离散余弦变换(DCT)的一种新的快速算法,对于N×N DCT(N=2^m),只需用N个一维DCT和若干加法运算。与常规的行-列法相比,所需的乘法运算量减少了一半,也比其它的快速算法的乘法运算量要少,而加法运算量基本上是相同的。
A new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N X N DCT, where N - 2', can be computed using only N 1-D DCT's and additions, instead of using 2N 1-D DCT's, as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others.
关键词
图象处理
离散余弦变换
快速算法
Image processing, Discrete cosine transform, Fast algorithm