Skip to main content
SpringerLink
Log in

Representation of the Fourier Transform by Fourier Series

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

The analysis of the mathematical structure of the integral Fourier transform shows that the transform can be split and represented by certain sets of frequencies as coefficients of Fourier series of periodic functions in the interval \([0,2\pi)\). In this paper we describe such periodic functions for the one- and two-dimensional Fourier transforms. The approximation of the inverse Fourier transform by periodic functions is described. The application of the new representation is considered for the discrete Fourier transform, when the transform is split into a set of short and separable 1-D transforms, and the discrete signal is represented as a set of short signals. Properties of such representation, which is called the paired representation, are considered and the basis paired functions are described. An effective application of new forms of representation of a two-dimensional image by splitting-signals is described for image enhancement. It is shown that by processing only one splitting-signal, one can achieve an enhancement that may exceed results of traditional methods of image enhancement.

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. N. Ahmed and R. Rao, Orthogonal Uransforms for Digital Signal Processing, Springer-Verlag, 1975.

  2. P.S. Addison, The Illustrated Wavelet Transform Handbook, Inst. of Physics Publishing: Philadelphia, 2002.

  3. S. Aghagolzadeh and O.K. Ersoy, “Transform image enhancement,” Optical Engineering, Vol. 31, No. 3, pp. 614–626, March 1992.

  4. R.E. Blahut, Fast Algorithms for Digital Signal Processing, Addison-Wesley: Reading, Mass, 1985.

  5. C.S. Burrus and T.W. Parks, DFT/FFT and Convolution Algorithms: Theory and Implementation, New York: Wiley, 1985.

  6. J.W. Cooley and J.W. Tukey, “An Algorithm the Machine Computation of Complex Fourier Series”, Math. Comput, Vol. 9, No. 2, pp. 297–301, 1965.

  7. I.C. Chan and K.L. Ho, “Split Vector-Radix Fast Fourier Transform”. IEEE Trans. on Signal Processing, Vol. 40, No. 8, pp. 2029–2040, Aug. 1992.

  8. I. Daubechies, Ten Lectures on Wavelets, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992.

  9. O. Ersoy, Fourier-Related Transform, Fast Algorithms and Applications, Prentice Hall, 1997.

  10. D.F. Elliot and K.R. Rao, Fast transforms - Algorithms, Analyzes, and Applications, New York: Academic, 1982.

  11. G.T. Fechner, Elements of Psychophysics, Vol. 1, Rinehart & Winston: New York, 1960.

  12. R.C. Gonzalez, Digital Image Processing, (2nd Edition) Prentice Hall, 2001.

  13. A.M. Grigoryan and S.S. Agaian, Multidimensional Discrete Unitary Transforms: Representation, Partitioning and Algorithms,” Marcel Dekker Inc.: New York, 2003.

  14. A.M. Grigoryan, “Algorithm of computation of the discrete Fourier transform with arbitrary orders,” Vichislit. Matem. i Mat. Fiziki, Vol. 31, No. 10, pp. 112–117, 1991.

  15. A.M. Grigoryan, “A novel algorithm for computing the 1-D discrete Hartley transform,” IEEE Signal Processing Letters, Vol. 11, No. 2, pp. 156–159, Feb. 2004.

  16. A.M. Grigoryan, “An algorithm for calculation of the discrete cosine transform by paired transform,” IEEE Trans. on Signal Processing, Vol. 53, No. 1, pp. 265–273, 2005.

  17. A.M. Grigoryan and V.S. Bhamidipati, “Method of flow graph simplification for the 16-point discrete Fourier transform,” IEEE Trans. on Signal Processing, Vol. 53, No. 1, pp. 384–389, 2005.

  18. A.M. Grigoryan and S.S. Agaian, “Split manageable efficient algorithm for Fourier and Hadamard transforms,” IEEE Trans. on Signal Processing, Vol. 48, No. 1, pp. 172–183, 2000.

  19. A.M. Grigoryan and S.S. Agaian, “Shifted Fourier transform based tensor algorithms for 2-D DCT,” IEEE Trans. on Signal Processing, Vol. 49, No. 9, pp. 2113–2126, 2001.

  20. A.M. Grigoryan, “Method ofpaired transforms for reconstruction of images from projections: Discrete model,” IEEE Trans. on Image Processing, Vol. 12, No. 9, pp. 985–994, 2003.

  21. A.M. Grigoryan and S.S. Agaian, “Transform-Based Image Enhancement Algorithms With Performance Measure,” Advances in Imaging and Electron Physics, Academic Press, Vol. 130, pp. 165–242, 2004.

  22. A.M. Grigoryan, “2-D and 1-D multi-paired transforms: Frequency-time type wavelets,” IEEE Trans, on Signal Processing, Vol. 49, No. 2, pp. 344–353, 2001.

  23. A.M. Grigoryan et al., “A new measure of image enhancement,” Processing of the conference ACIVS 2001, IEEE Signal Processing, Baden-Baden, 2001.

  24. I.E. Gordon, Theory of Visual Perception, John Wiley & Sons: New York, 1989.

  25. A. Jain, Fundamentals of Digital Image Processing, Prentice Hall: Englewood Cliffs, NJ, 1989.

  26. A.N. Kolmogorov and S.V. Fomin, Elements of the Theory of Functions and Functional Analysis, Moscow: Nauka, 1972.

  27. S.G. Mallat, A Wavelet Tour of Signal Processing, (2nd edition) San Diego: Academic Press, 1998.

  28. J.H. McClellan, “Artifacts in alpha-rooting of images,” in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, April 1980, pp. 449–452.

  29. H.J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, 2nd ed., Springer - Verlag: Berlin, 1982.

  30. A.V. Oppenheim and R.W. Schafer, Discrete-Time Signal Processing, Prentice Hall: Englewood Cliffs, New Jersey, 1989.

  31. L. Rabiner and R.W. Schaefer, Speech Signal Processing, Prentice Hall: Englewood Cliffis, New Jersey, 1983.

  32. D. Wang and A.H. Vagnucci, “Digital image enhancement,” Computer Vision, Graphics, Image Processing, Vol. 24, pp. 363–381, 1981.

  33. L.A. Zalmonzon, Fourier, Walsh, and Haar Transforms and Their Application in Control, Communication and Other Fields, Moscow: Nauka, 1989.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, The University of Texas at San Antonio, 6900 North Loop 1604 West, San Antonio, TX, 78249-0669

    Artyom M. Grigoryan

Authors
  1. Artyom M. Grigoryan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Artyom M. Grigoryan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grigoryan, A.M. Representation of the Fourier Transform by Fourier Series. J Math Imaging Vis 25, 87–105 (2006). https://doi.org/10.1007/s10851-006-5150-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10851-006-5150-0

Keywords

Search

Navigation