二维Tchebichef矩正反变换的快速算法  

A Method For Efficiently Computing Two-dimensional Forward and Inverse Tchebichef Orthogonal Moments

作　　者：章品正[1] 王征[1] 徐琴珍[2] 舒华忠[1] 

机构地区：[1]南京东南大学计算机科学与工程系影像科学与技术实验室,210096 [2]南京东南大学无线电工程系信号与信息处理实验室,210096

出　　处：《信号处理》2007年第1期69-72,共4页Journal of Signal Processing

摘　　要：本文提出了一种二维Tchebichef矩正反变换的快速算法。在正变换中,使用Chebichef递推公式推导了一维Tchebichef矩正变换的快速算法,并将其推广至二维Tchebichef矩正变换的快速计算。在反变换中,使用Clenshaw递推公式我们推导了一维Tchebichef矩反变换的快速算法,并将其推广至二维Tchebichef正交矩反变换的计算。与以迭代方式计算Tchebichef多项式进而计算二维Tchebichef矩正反变换的方法相比,本文算法有效地减少了算术运算的次数,提高了计算速度。实验结果表明了该方法的有效性。An efficient two-dimensional forward and inverse Tchebichef orthogonal moment computation method was proposed in this paper. In forward transform, we deduced a fast method for calculating the one-dimensional Tchebichef moments by using Chebichef recurrence formula. Then,it was extended to two-dimensional forward Tchebichef moment＇s computation. In inverse transform, we deduced a fast method for calculating the one-dimensional inverse Tchebichef moments by using Clenshaw＇ s recurrence formula. Then, it was extended to two-dimensional inverse Tchebichef moment＇s computation. Experimental results show that the new method reduces the computational complexity compared with the direct method.

关 键 词：chebichef递推式 TCHEBICHEF矩 Clenshaw迭代算法 快速算法 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]