Re: FFT implementation in ImageJ

Posted by Dimiter Prodanov (imec) on Jun 23, 2014; 12:24pm
URL: http://imagej.273.s1.nabble.com/FFT-implementation-in-ImageJ-tp5008239p5008370.html

Dear Mariam,

It is a good idea to always check against Matlab when you do processing in the Fourier domain.
The implementations there are tested and they are numerically correct.
If you want to understand FFT you have to start with the papers of  Cooley  Tukey and Lanczos.

As fat as ImageJ is concerned there is no standard for handling complex float or double numbers which makes using FFT-based algorithms more complicated.
Daniel pointed out all the issues that have to be taken on account when deciding which algorithm to use.
I would say that the non-pow2 issue is less important as confocal microscopic images are power of 2.
What is would add to the list are also windowing functions and boundary conditions.
The usual zero-padding for example in most of the cases is not a good idea for images.  
Dimensionality is also not that important as FFT is separable.

 
Best regards,


Dimiter Prodanov

 

 

 

--
ImageJ mailing list: http://imagej.nih.gov/ij/list.html