Modification of a two-dimensional fast Fourier transform algorithm by the analog of the Cooley-Tukey algorithm for a rectangular signal

2015 ◽  
Vol 25 (1) ◽  
pp. 81-83 ◽  
Author(s):  
M. V. Noskov ◽  
V. S. Tutatchikov
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Two Dimensional ◽  
Fast Fourier Transform Algorithm ◽  
Rectangular Signal

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.

Computer aided measurement of biomechanical characteristics of cadaverous lumbar spines

Open Physics ◽  
2004 ◽  
Vol 2 (3) ◽  
Author(s):  
Luděk Bartoněk ◽  
Jiří Keprt ◽  
Jiří Charamza ◽  
Lumír Hrabálek
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Laser Light ◽  
Ccd Camera ◽  
Optical Signal ◽  
Two Dimensional ◽  
Fast Fourier Transform Algorithm ◽  
Interference Fringes ◽  
Computer Aided

AbstractSpecial computer-aided equipment was designed for measurement of biomechanical characteristics of lower part of the spine (L1-L5). When the stress is applied, it is necessary to observe the shift of the sample elements, together with measurement of the spine rigidity. This shift is determined with the help of circular targets fitted to the appropriate vertebra. The targets, illuminated by lamp or laser light, are monitored and their digitalized images are scanned by CCD camera is stored as computer media. The two dimensional Fourier transform of the digital optical signal is obtained by the fast Fourier transform algorithm. The period and direction of the interference fringes determine the size and the direction of the sample shift.

scholarly journals Application of parallel version two-dimensional fast Fourier transform algorithm, analog of the Cooley-Tukey algorithm, for digital image processing of satellite data

2019 ◽  
Vol 75 ◽  
pp. 01012 ◽  
Author(s):  
Mikhail Noskov ◽  
Valeriy Tutatchikov ◽  
Mikhail Lapchik ◽  
Marina Ragulina ◽  
Tatiana Yamskikh
Keyword(s):  
Remote Sensing ◽  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Satellite Images ◽  
Satellite Image ◽  
Digital Processing ◽  
Two Dimensional ◽  
Fast Fourier Transform Algorithm ◽  
Suburban Areas ◽  
Parallel Version

In modern systems of remote sensing two-dimensional fast Fourier transform (FFT) has been widely used for digital processing of satellite images and subsequent image filtering. This article provides a parallel version two-dimensional fast Fourier transform algorithm, analog of the Cooley-Tukey algorithm and its implementation for processing the satellite image of Krasnoyarsk and its suburban areas.

Parallelisation of a 2-D Fast Fourier Transform Algorithm

1991 ◽  
Vol 02 (01) ◽  
pp. 363-366 ◽  
Author(s):  
ANDREW HAMMERSLEY
Keyword(s):  
Fourier Transform ◽  
Data Analysis ◽  
Fast Fourier Transform ◽  
Fourier Transforms ◽  
Computational Physics ◽  
Fast Fourier Transforms ◽  
Two Dimensional ◽  
Fast Fourier Transform Algorithm ◽  
Higher Dimension ◽  
Parallel Network

The calculation of two and higher-dimension Fast Fourier Transforms (FFT’s) are of great importance in many areas of data analysis and computational physics. The two-dimensional FFT is implemented for a parallel network using a master-slave approach. In-place performance is good, but the use of this technique as an “accelerator” is limited by the communications time between the host and the network. The total time is reduced by performing the host-master communications in parallel with the master-slave communications. Results for the calculation of the two-dimensional FFT of real-valued datasets are presented.

Sign in / Sign up

Export Citation Format

Share Document