Chebyshev-Fourier矩的快速计算方法  

A Fast Algorithm for Computing Chebyshev-Fourier Moments

作　　者：周卫平[1] 李松毅[1] 舒华忠[1] 

机构地区：[1]东南大学计算机科学与工程系,南京210096

出　　处：《计算机学报》2005年第8期1393-1397,共5页Chinese Journal of Computers

基　　金：国家自然科学基金(60272045);教育部新世纪优秀人才支持计划资助.

摘　　要：给出了求解Chebyshev-Fourier正交矩及其反变换的快速算法.和其它类型的正交矩相比,Chebyshev-Fourier正交矩不仅表达形式简单,而且具有更好的图像描述能力和鲁棒性.利用Clenshaw递推公式,作者实现了一维Fourier变换及多项式求和运算的快速计算,大大减少了复指数运算的次数,降低了计算复杂度,从而加快了Chebyshev-Fourier矩正、反变换的运算时间.图像的重建结果表明,该算法和直接计算方法具有相同的精度和稳定性,但效率更高.A fast algorithm for computing Chebyshev-Fourier moments and their inverse trans forms is presented. Compared with other orthogonal moments, Chebyshev-Fourier moments have better performance in image description and robustness. Using the Clenshaw＇s recurrence formula, the number of complex exponential operations can be reduced significantly in the calculation of one dimension Fourier transform and the sum of two dimension multinomial. The reconstruction results show that it has the same precision and robustness to noise as the straightforward method, but our method has better efficiency.

关 键 词：CHEBYSHEV多项式 Chebyshev-Fourier矩 图像重建 快速计算 

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