This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Conference on Information Technology and Applications (ICITA'05) Volume 1
Fast Fourier Transform in the Spiral Honeycomb Image Algebra
Sydney, Australia
July 04-July 07
ISBN: 0-7695-2316-1
Phil Sheridan, Griffith University Qld
David M. Alexander, University of Technology - Sydney
Kelly S. Nunn-Clark, Charles Sturt University
The Fourier transform is one of the most important transformations in image processing. A major component of this influence comes from the ability to implement it efficiently on a digital computer. This paper describes one such efficient implementation and discusses its implications to digital technology as well as biological vision. The significance of the fast Fourier transform (FFT) presented in this paper is that it provides geometrical meaning to the regrouping of a Cooley-Tukey type FFT.
Index Terms:
fast Fourier transform, hexagonal lattice, image
Citation:
Phil Sheridan, David M. Alexander, Kelly S. Nunn-Clark, "Fast Fourier Transform in the Spiral Honeycomb Image Algebra," icita, vol. 1, pp.726-731, Third International Conference on Information Technology and Applications (ICITA'05) Volume 1, 2005
Usage of this product signifies your acceptance of the Terms of Use.