Posted by
ctrueden on
URL: http://imagej.273.s1.nabble.com/FFT-implementation-in-ImageJ-tp5008239p5008242.html
Hi Herbie & Mariam,
> You may also have a look at the code in "Numerical Recipes". However, you
> have to change the C code to Java, which is rather easy.
Note that Numerical Recipes code is released under a very restrictive
license. Specifically: redistribution is prohibited. So if you are
producing open source software, you will need to stay away from it.
Regards,
Curtis
On Mon, Jun 16, 2014 at 12:16 PM, Herbie <
[hidden email]> wrote:
> Mariam,
>
> ImageJ computes the 2D FFT via the 2D FHT.
>
> The resulting transforms (Fourier-spectra) are essentially the same as
> with a (direct) "classical" 2D FFT implementation. However the computation
> is faster.
>
> There is a plugin called FFTJ which is based on "classical 2D" FFT
> implementation. The source code is available.
>
> You may also have a look at the code in "Numerical Recipes". However, you
> have to change the C code to Java, which is rather easy.
>
> HTH
>
> Herbie
>
> ::::::::::::::::::::::::::::::::::
>
> On 16.06.14 18:58, Student1 wrote:
>
>> Hi,
>>
>> I was wondering if ImageJ has standard FFT algorithm? Because I know
>> ImageJ has a FFT window and it also FHT window, so does the FFT
>> implementation based on the FHT algorithm? When I look into the code
>> I basically see the FHT implementation but not a standard FFT
>> algorithm.
>>
>> Thanks.
>>
>> Mariam Dost -- ImageJ mailing list:
>>
http://imagej.nih.gov/ij/list.html>>
>
> --
> ImageJ mailing list:
http://imagej.nih.gov/ij/list.html>
--
ImageJ mailing list:
http://imagej.nih.gov/ij/list.html