A fast recursive algorithm for the 2D sliding rectangular window FFT
二维滑动矩形窗傅氏变换的快速递推算法

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.