| genre | Fourier |
| status | stable |
| author | Tobias Böhler |
| package | MeVisLab/Standard |
| dll | MLFourier |
| definition | MLFourier.def |
| keywords | FFT, DFT, fast, fourier, transformation, inverse, 2d, sande, tukey, cooke |
The module FFT2D computes a two-dimensional (2-D) Fast Fourier Transformation of the given input image, or the inverse FFT.
The FFT will only be computed from images that have dimensions of powers of two (e.g. 512, 256, 16). Width and height need not to be identical.
The FFT will be computed using the Sande-Tukey algorithm, providing a stable and considerably fast method of computing the discrete Fourier Transform.
However, this requires the images to have dimensions of 2n.
| 2D computation: Bool |
| Center the FFT: Bool |
| Direction: Enum |
| Output Type: Enum |
| Scale Factor: Double |
| Use logarithmic scale: Bool |
Defines the operation on the input image.
Values:
| Title | Name | Description |
|---|---|---|
| Forward | Forward | Computes a FFT. |
| Inverse | Inverse | Computes the inverse FFT. Note that in this mode, the input image needs to be of type complex. |
If checked, the output values are being logarithmically scales for a better visualization (see Gonzales, Woods).
Sets the logarithmic scale factor that is used if Use logarithmic scale is checked.
If checked, the FFT will be centered so that the origin will be set to (imageWidth/2), (imageHeight/2).
Since higher frequencies can be found around the origin, this allows an intuitive visualization, especially when the spectrum is displayed. This view is often used in image processing textbooks.