Images Recognition Using the Fast Fourier Transformation (FFT) Algorithm

Authors

  • Oleksandr Tymoshchuk Department of Information Systems and Computing Methods, Stepan Demyanchuk International University of Economics and Humanities
  • Petro Janchuk Department of Information Systems and Computing Methods, Stepan Demyanchuk International University of Economics and Humanities

Keywords:

Fast Fourier Transform (FFT), Discrete Fourier Transform (DFT)

Abstract

In the field of computer vision and image processing, the search for efficient and accurate image recognition methods is constantly evolving. The Fast Fourier Transform (FFT) algorithm is a powerful tool that has found wide application in various fields, including image processing. This article explores the use of FFT in image recognition problems, elucidating its principles, methodologies, and practical implementations.

Downloads

Published

2024-05-24

Issue

Section

Section 2 Information theory, coding and information form transformation