%0 Journal Article
%T A NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM<br>二维离散余弦变换的一种新的快速算法
%A Lu Jie
%A Wang Xincheng
%A Zhu Weile
%A <br>卢颉
%A 王新成
%A 朱维乐
%J 电子与信息学报
%D 1994
%I 
%X 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.
%K Image processing
%K Discrete cosine transform
%K Fast algorithm<br>图象处理
%K 离散余弦变换
%K 快速算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=013A898DD407C7336DD088670DC2E757&yid=3EBE383EEA0A6494&vid=7801E6FC5AE9020C&iid=B31275AF3241DB2D&sid=39E48869A719B9DE&eid=93ADA2AA3F969E58&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=5