Fast Fourier Transformation

• Computation of 2D the Fourier transform
• can be applied to single 2D image or entire stack (image by image - not 3D)
• Advantage over FFT provided by DigitalMicrograph (GMS 1.x): computes also for images with sizes other than 2ⁿ by 2ⁿ

Forward FFT

• Shortcut: "F3"

• In contrast to most of the other algorithms the forward Fourier transform is normalized by the pixel number

Inverse FFT

• Shortcut: "F4"

• In contrast to most of the other algorithms the inverse Fourier transform is NOT normalized by the pixel number