Skip to main content
SpringerLink
Log in

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

  • Applied Problems
  • Published:
Pattern Recognition and Image Analysis Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. C. Gonzalez and R. E. Woods, Digital Image Processing (Prentice Hall, Upper Saddle River, NJ, 2002).

    Google Scholar 

  2. R. E. Blahut, Fast Algorithms for Digital Signal Processing (Addison-Wesley Press, 1985).

    MATH  Google Scholar 

  3. D. E. Dudgeon and R. M. Mersereau, Multidimensional Digital Signal Processing (Prentice Hall, 1983).

    MATH  Google Scholar 

  4. V. S. Tutatchikov, O. I. Kiselev, and M. V. Noskov, “Calculating the n-dimensional fast Fourier transform,” Pattern Recogn. Image Anal. 23 (3), 429–433 (2013).

    Article  Google Scholar 

  5. M. V. Noskov and V. S. Tutatchikov, “Modification of a two-dimensional fast Fourier transform by the analog of the Cooley-Tukey algorithm for a rectangular signal,” Pattern Recogn. Image Anal. 25 (1), 81–83 (2015).

    Article  Google Scholar 

  6. M. V. Noskov and V. S. Tutatchikov, “Parallel version n-dimensional fast Fourier transform algorithm analog of the Cooley-Tukey algorithm,” in Proc. 5th Int. Workshop on Image Mining. Theory and Applications (Berlin, 2015), pp. 114–117.

    Google Scholar 

  7. V. S. Tutatchikov, “Two-dimensional fast Fourier transform: Batterfly in analog of Cooley-Tukey algorithm,” in Proc. 11th Int. Forum on Strategic Technology (IFOST-2016) (Novosibirsk, 2016), Part 1, pp. 495–498.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Space and Information Technology, Siberian Federal University, Krasnoyarsk, 660074, Russia

    M. V. Noskov & V. S. Tutatchikov

Authors
  1. M. V. Noskov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. S. Tutatchikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. V. Noskov.

Additional information

Mikhail Valerianovich Noskov. Born 1947. Graduated from Krasnoyarsk State Pedagogical Institute in 1969. Received candidate’s degree in 1984 and doctoral degree in 1992. Currently professor at Siberian Federal University. Scientific interests: cubature formulas, methods for training mathematics. Author of 60 publications.

Valerii Sergeevich Tutatchikov. Born 1988. Graduated from Institute of Space and Information Technology, Siberian Federal University, in 2011. Currently postgraduate at same university. Scientific interests: fast Fourier transform and parallel algorithms. Author of 20 publications.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Noskov, M.V., Tutatchikov, V.S. Modification of a two-dimensional fast Fourier transform algorithm with an analog of the Cooley–Tukey algorithm for image processing. Pattern Recognit. Image Anal. 27, 110–113 (2017). https://doi.org/10.1134/S1054661817010096

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1054661817010096

Keywords

Search

Navigation