Modification of a two-dimensional fast Fourier transform algorithm with an analog of the Cooley–Tukey algorithm for image processing
| Autor: | M. V. Noskov, V. S. Tutatchikov |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Cooley–Tukey FFT algorithm
Computer science Fast Fourier transform Prime-factor FFT algorithm 02 engineering and technology 01 natural sciences Computer Graphics and Computer-Aided Design Discrete Fourier transform 010309 optics Multidimensional signal processing Split-radix FFT algorithm Rader's FFT algorithm 0103 physical sciences 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Computer Vision and Pattern Recognition Algorithm Twiddle factor |
| Zdroj: | Pattern Recognition and Image Analysis. 27:110-113 |
| ISSN: | 1555-6212 1054-6618 |
| DOI: | 10.1134/s1054661817010096 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink