| 二维离散余弦变换的一种新的快速算法 |
| |
| 引用本文： | 卢颉,王新成,朱维乐.二维离散余弦变换的一种新的快速算法[J].电子与信息学报,1994,16(6):576-581. |
| |
| 作者姓名： | 卢颉 王新成 朱维乐 |
| |
| 作者单位： | 清华大学电子工程系，清华大学电子工程系，清华大学电子工程系 北京 100084，北京 100084，北京 100084 |
| |
| 摘 要： | 本文介绍了二维离散余弦变换(DCT)的一种新的快速算法。对于N×N DCT(N=2~m),只需用N个一维DCT和若干加法运算。与常规的行-列法相比,所需的乘法运算量减少了一半,也比其它的快速算法的乘法运算量要少,而加法运算量基本上是相同的。
|
| 关 键 词： | 图象处理 离散余弦变换 快速算法 |
| 收稿时间： | 1993-5-8 |
| 修稿时间： | 1994-4-13 |
A NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM |
| |
| Lu Jie,Wang Xincheng,Zhu Weile.A NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM[J].Journal of Electronics & Information Technology,1994,16(6):576-581. |
| |
| Authors: | Lu Jie Wang Xincheng Zhu Weile |
| |
| Affiliation: | Department of Electronic Engineering, Tsinghua University, Beijing 100084 |
| |
| 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 - 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. |
| |
| Keywords: | Image processing Discrete cosine transform Fast algorithm |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《电子与信息学报》浏览原始摘要信息 |
|
点击此处可从《电子与信息学报》下载全文 |
|
