New fast algorithm for two-dimensional discrete Fourier transform DFT(2n; 2)

1989 ◽  
Vol 25 (1) ◽  
pp. 21-22 ◽  
Author(s):  
Weizhen Ma ◽  
Dekun Yang
Keyword(s):  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Fast Algorithm ◽  
Two Dimensional

scholarly journals Application of two-dimensional fast Fourier transform algorithm, analog of the Cooley-Tukey algorithm, for 4k fixed format digital image of satellite data in frequency domain processing

2020 ◽  
Vol 149 ◽  
pp. 02010 ◽  
Author(s):  
Mikhail Noskov ◽  
Valeriy Tutatchikov
Keyword(s):  
Fourier Transform ◽  
Numerical Experiment ◽  
Fast Fourier Transform ◽  
Frequency Domain ◽  
Discrete Fourier Transform ◽  
Satellite Data ◽  
Digital Image ◽  
Digital Images ◽  
Two Dimensional ◽  
Fast Fourier Transform Algorithm

Currently, digital images in the format Full HD (1920 * 1080 pixels) and 4K (4096 * 3072) are widespread. This article will consider the option of processing a similar image in the frequency domain. As an example, take a snapshot of the earth's surface. The discrete Fourier transform will be computed using a two-dimensional analogue of the Cooley-Tukey algorithm and in a standard way by rows and columns. Let us compare the required number of operations and the results of a numerical experiment. Consider the examples of image filtering.

Sign in / Sign up

Export Citation Format

Share Document