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

Описание

Тип публикации: статья из журнала

Год издания: 2017

Идентификатор DOI: 10.1134/S1054661817010096

Ключевые слова: digital signal processing, fast Fourier transform, Fast Fourier transforms, Signal processing, Complex addition, Digital image, Method of calculation, Multiplication operations, Two dimensional fast Fourier transforms, Two-dimensional FFT, Image processing

Аннотация: 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 multiplicПоказать полностьюation operations than the standard method of calculation by rows and columns. © 2017, Pleiades Publishing, Ltd.

Ссылки на полный текст

Издание

Журнал: Pattern Recognition and Image Analysis

Выпуск журнала: Vol. 27, Is. 1

Номера страниц: 110-113

Персоны

  • Noskov M.V. (Institute of Space and Information Technology, Siberian Federal University, Krasnoyarsk, Russian Federation)
  • Tutatchikov V.S. (Institute of Space and Information Technology, Siberian Federal University, Krasnoyarsk, Russian Federation)

Вхождение в базы данных