Fourier Transforms in Digital Image Processing Courses
DOI:
https://doi.org/10.54097/dx94s002Keywords:
Fourier Transform, Circulant Matrix, Periodic ConvolutionAbstract
To help teaching and learning of Fourier transforms in digital image processing courses, an approach to the Fourier transforms from a standpoint of linear algebra is presented. After representing a periodic sequence by a circulant matrix, the periodic convolution can be formulated in terms of matrix multiplication, and finally, the Fourier transform is written in a form of matrix diagonalization. As a comparison, summation formulas are prevalent in traditional courses on signals and systems and matrices are scarcely found in textbooks of digital signal processing. We hope that this approach will make the Fourier transform easier to teach and learn in digital image processing courses.
Downloads
References
Alan V. Oppenheim, Alan Willsky, and Barry Van Veen (1996). Systems and signals (2nd edition). Pearson.
Simon Haykin and Barry Van Veen (2002). Systems and signals (2nd edition). John Wiley & Sons.
Alan V. Oppenheim and Ronald W. Schafer (2010). Discrete-time signal processing (3rd edition). Pearson.
John G. Proakis and Dimitris G. Manolakis (2022). Digital signal processing: principles, algorithms, and applications (5th edition). Pearson.
Rafael C. Gonzalez and Richard E. Woods (2018). Digital image processing (4th edition). Pearson.
Gilbert Strang (2022). Linear algebra and learning from data. Wellesley-Cambridge Press.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Journal of Education and Educational Research

This work is licensed under a Creative Commons Attribution 4.0 International License.









