二維離散余弦變換的一種新的快速算法
A NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM
-
摘要: 本文介紹了二維離散余弦變換(DCT)的一種新的快速算法。對(duì)于NN DCT(N=2m),只需用N個(gè)一維DCT和若干加法運(yùn)算。與常規(guī)的行-列法相比,所需的乘法運(yùn)算量減少了一半,也比其它的快速算法的乘法運(yùn)算量要少,而加法運(yùn)算量基本上是相同的。
-
關(guān)鍵詞:
- 圖象處理; 離散余弦變換; 快速算法
Abstract: 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 = 2m, 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. -
Lee B C. IEEE Trans. on ASSP, 1984, ASSP-32(12): 1243-1245.[2]Yang Jar-Ferr, Shaih Shih-Chang, Bai Bor-Long. IEEE Trans. on CE, 1993. CE-39(4): 934-940.[3]Duhamel P.[J].Guillemot C. Polynomial Transform Computation of 2-D DCT, in Proc. ICASSP90, New York, USA.1515,1990:-[4]Chau L-P, Sui W-C. Electron. Lett., 1994, 30(3): 197-198.[5]Lee M H, Crebbin G. IEE Proc.-F, Radar Image and Signal Processing, 1994, 141(1): 39-48. -
計(jì)量
- 文章訪問(wèn)數(shù): 2596
- HTML全文瀏覽量: 143
- PDF下載量: 351
- 被引次數(shù): 0
下載:
