二维滑动矩形窗傅氏变换的快速递推算法  

A FAST RECURSIVE ALGORITHM FOR THE 2D SLIDING RECTANGULAR WINDOW FFT

作　　者：张丽飞[1] 杨鸿波[1] 王东峰[1] 邹谋炎[1] 

机构地区：[1]中国科学院电子学研究所,北京100080

出　　处：《电子与信息学报》2003年第10期1334-1340,共7页Journal of Electronics & Information Technology

摘　　要：该文利用相邻滑动窗数据之间的关系以及傅氏变换的平移性质,提出一种二维滑动矩形窗傅氏变换的快速递推算法。文中分析了该快速递推算法的复杂度和传统直接计算法的复杂度,证明了新的快速递推法可以大大降低计算复杂性,尤其是在图像尺寸和窗口尺寸较大的场合中。该算法可以改善滑窗傅氏变换或Gabor变换的计算效率。In this paper, a fast recursive algorithm for the 2D sliding rectangular window FFT is proposed, based on the relationship of neighbor windows and the transformation property of the FFT. Further, the fast recursive algorithm is extended into 2D Gabor transformation of sliding rectangular windows. An analysis and a comparison on the computational complexity between the recursive algorithm and the traditional direct method are given. Both the theoretical analysis and the experimental result show that the new recursive algorithm can reduce the computation cost greatly, especially in the case of bigger image size or/and bigger window size. The proposed recursive algorithm can improve the computation efficiency of image analysis using the slide rectangular window FFT or Gabor transform.

关 键 词：图像分析 纹理分析 快速傅氏变换 GABOR变换 递推算法 二维滑动矩形窗 

分 类 号：TN911.73[电子电信—通信与信息系统]