基于圆域上多项式逼近的图像重建算法  

Image reconstruction algorithm based on polynomial approximation on a circular domain

作　　者：孙雪楠[1] 梁学章[1] 

机构地区：[1]吉林大学数学研究所,长春130012

出　　处：《吉林大学学报（理学版）》2004年第3期351-355,共5页Journal of Jilin University:Science Edition

摘　　要：以Marr算法为基础,给出了圆域D上图像重建的一种基于二元多项式逼近的加速算法.加速后算法的计算量为O(NlgN),当N较大时,新算法的运行时间远小于原算法的运行时间.同时,与传统图像重建算法滤波反投影算法(FBP)相比,基于多项式逼近加速算法重建的图像质量优于前者.仿真实验验证了此算法的有效性.On the basis of the Marr's algorithm, a new fast algorithm for image reconstruction based on bivariate polynomial approximation on a circular domain is presented. The computational complexity of the algorithm is O(Nlg N). The execution time of the new algorithm is far shorter than that of the old one. Furthermore, compared with the traditional methodfilter back projection algorithm, the quality of the reconstruction image from the algorithm based on polynomial approximation is better. The computer simulation experiment has shown the efficiency of the algorithm.

关 键 词：RADON变换 图像重建 快速FOURIER变换 CHEBYSHEV多项式 

分 类 号：O241.5[理学—计算数学]