PANDORE Version 6 GREYC-IMAGE

pfft



Performs Fast Fourier Transform.



Synopsis

pfft [-m mask] [im_in1|-] [im_in2|-] [im_out1|-] [im_out2|-]

Description

pfft computes the Fast Fourier Transform of the input complex image im_in1. The input complex image is composed of two images:

The imaginary image must be at least empty (see pnewimage, psetcst).

The output complex images is also composed of two images:

Fast Fourier Transform is a way of going from the spatial domain to the frequency domain:

The Fourier transform of an image represents the likeness degree between the image seen as function f and the functions are sine and cosine with various frequencies. Each point represents a particular frequency in the spatial domain.

if N is the number of pixels.
F(u,v) = 1/(N*N) * Sigma(x){Sigma(y){ I(x,y)*exp(-i2PI((u*i)/N+(v*i)/N))}}

This equation can be interpreted as follows:
The value of the point (u,v) results from the multiplication of the spatial image with the various basis function. The basis functions are sine and cosine with increasing frequencies. F(0,0) represents the mean intensity of the image, whereas F(N-1,N-1) represents the higher frequency.

The size of the output images im_out1 and im_out1 is the same as the input images im_in1 and im_in2.

Inputs

Outputs

Result

Returns SUCCESS or FAILURE.

Examples

Computes the magnitude of the Fast Fourier Transform of tangram.pan. The imaginary part (i1.pan) is null. (Use log transform dynamic in pvisu to display out.pan.):

   psetcst 0 tangram.pan i1.pan
   pfft tangram.pan i1.pan i2.pan i3.pan
   pfftshift i2.pan i3.pan i4.pan i5.pan
   pmodulus i4.pan i5.pan out.pan

See also

Frequency, pifft, pfftshift

C++ prototype

Errc PFFT( const Img2duc &im_in1, const Img2duc &im_in2, Img2dsf &im_out1, Img2dsf &im_out2 );

Version française

Calcul de la Transformée de Fourier Rapide d'une image.


Author: Herissay & Berthet