%0 Journal Article
%T A fast recursive algorithm for the 2D sliding rectangular window FFT<br>二维滑动矩形窗傅氏变换的快速递推算法
%A Zhang Lifei
%A Yang Hongbo
%A Wang Dongfeng
%A Zou Mouyan
%A <br>张丽飞
%A 杨鸿波
%A 王东峰
%A 邹谋炎
%J 电子与信息学报
%D 2003
%I 
%X 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.
%K Image analysis
%K Texture analysis
%K FFT
%K Gabor transformation
%K Recursive algorithm<br>图像分析
%K 纹理分析
%K 快速傅氏变换
%K Gabor变换
%K 递推算法
%K 二维滑动矩形窗
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=F427E13F8E83808D&yid=D43C4A19B2EE3C0A&vid=C5154311167311FE&iid=F3090AE9B60B7ED1&sid=C0C56F7E9227DF7D&eid=CEEFA682892739FB&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=8