Fast Hypercomplex Polar Fourier Analysis for Image Processing

  • Zhuo Yang
  • Sei-ichiro Kamata
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7088)

Abstract

Hypercomplex polar Fourier analysis treats a signal as a vector field and generalizes the conventional polar Fourier analysis. It can handle signals represented by hypercomplex numbers such as color images. It is reversible that can reconstruct image. Its coefficient has rotation invariance property that can be used for feature extraction. With these properties, it can be used for image processing applications like image representation and image understanding. However in order to increase the computation speed, fast algorithm is needed especially for image processing applications like realtime systems and limited resource platforms. This paper presents fast hypercomplex polar Fourier analysis that based on symmetric properties and mathematical properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric eight points simultaneously that significantly reduce the computation time.

Keywords

fast hypercomplex polar Fourier analysis hypercomplex polar Fourier analysis Fourier analysis 
Download to read the full conference paper text

References

  1. 1.
    Bracewell, R.N.: The Fourier transform and its applications. McGraw-Hill (2000)Google Scholar
  2. 2.
    Hamilton, W.R.: Elements of Quaternions. Longmans Green, London (1866)Google Scholar
  3. 3.
    Ell, T.A., Sangwine, S.J.: Hypercomplex Fourier Transforms of Color Images. IEEE Trans. IP 16(1), 22–35 (2007)MathSciNetMATHGoogle Scholar
  4. 4.
    Yeh, M.-H.: Relationships Among Various 2-D Quaternion Fourier Transforms. IEEE Trans. SPL 15, 669–672 (2008)Google Scholar
  5. 5.
    Alexiadis, D.S., Sergiadis, G.D.: Motion estimation, segmentation and separation, using hypercomplex phase correlation, clustering techniques and graph-based optimization. Computer Vision and Image Understanding 113(2), 212–234 (2009)CrossRefGoogle Scholar
  6. 6.
    Subakan, O.N., Vemuri, B.C.: A Quaternion Framework for Color Image Smoothing and Segmentation. International Journal of Computer Vision 91(3), 233–250 (2011)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Wang, Q., Ronneberger, O., Burkhardt, H.: Rotational Invariance Based on Fourier Analysis in Polar and Spherical Coordinates. IEEE Trans. PAMI 31(9), 1715–1722 (2009)CrossRefGoogle Scholar
  8. 8.
    Yang, Z., Kamata, S.: Hypercomplex Polar Fourier Analysis for Image Representation. IEICE Trans. on Info. and Sys. E94-D(8), 1663–1670 (2011)Google Scholar
  9. 9.
    Ward, J.P.: Quaternions and Cayley Numbers, Algebra and Applications. Springer, Heidelberg (1997)MATHGoogle Scholar
  10. 10.
    Andrews, L.: Special Functions of Mathematics for Engineers, 2nd edn. SPIE Press (1997)Google Scholar
  11. 11.
    Kosmala, W.: Advanced Calculus: a friendly approach. Prentice-Hall (1999)Google Scholar
  12. 12.
    Burrus, C.S., Parks, T.W.: DFT/FFT and Convolution Algorithms and Implementation. John Wiley & Sons (1985)Google Scholar
  13. 13.
    The Gnu Scientific Library, http://www.gnu.org/software/gsl/

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Zhuo Yang
    • 1
  • Sei-ichiro Kamata
    • 1
  1. 1.Graduate School of Information, Production and SystemsWaseda UniversityJapan

Personalised recommendations