Modification of a two-dimensional fast Fourier transform algorithm with an analog of the Cooley–Tukey algorithm for image processing

Abstract

Two-dimensional fast Fourier transform (FFT) for image processing and filtering is widely used in modern digital image processing systems. This paper concerns the possibility of using a modification of two-dimensional FFT with an analog of the Cooley–Tukey algorithm, which requires a smaller number of complex addition and multiplication operations than the standard method of calculation by rows and columns.