Spinor Fourier Transform for Image Processing

Clifford-Fourier Transform for Color Image Processing

The aim of this paper is to define a Clifford Fourier transform that is suitable for color image spectral analysis. There have been many attempts to define such a transformation using quaternions or Clifford algebras. We focus here on a geometric approach using group actions. The idea is to generalize the usual definition based on the characters of abelian groups by considering group morphisms ...

An Accurate Discrete Fourier Transform for Image Processing

The classical method of numerically computing the Fourier transform of digitizedfunctions in one or in ddimensions is the so-called discrete Fourier transform ( D F T ) , efficiently implemented as Fast Fourier Transform ( F F T ) algorithms. In m n y cases the D F T is not an adequate appmximation of the continuous Fourier transform. The method presented in this contribution provides accurate ...

Fourier Transform – Signal Processing

2 - D Hexagonal Quaternion Fourier Transform in Color Image Processing

In this paper, we present a novel concept of the quaternion discrete Fourier transform on the two-dimensional hexagonal lattice, which we call the twodimensional hexagonal quaternion discrete Fourier transform (2-D HQDFT). The concept of the right-side 2D HQDFT is described and the left-side 2-D HQDFT is similarly con sidered. We analyze and present a new approach in processing the color images...

Fast Infinitesimal Fourier Transform for Signal and Image Processing via Multiparametric and Fractional Fourier Transforms

The fractional Fourier transforms (FrFTs) is one-parametric family of unitary transformations {F} α=0. FrFTs found a lot of applications in signal and image processing. The identical and classical Fourier transformations are both the special cases of the FrFTs. They correspond to α = 0 (F = I) and α = π/2 (F = F), respectively. Up to now, the fractional Fourier spectra Fi = Fi {f} , i = 1, 2, ....