I am currently trying to calculate the fft of an image.
To use this function, I am queuing the image data in an array and calling the above mentioned function (and detailed below)
Ftw_plan fftw_plan_dft_2d (int n0, int n1, fftw_complex * in, fftw_complex * out, int sign, unsigned flags); In the functional original size, modifies a complex array with a size equal to the number of pixels.
Did you know that this is the proper way to compute a 2D FFT computing image? If so, what does the outside representation of the data? IE where are the high and low frequency values in the array?
Thanks, DJs 22
A 2D FFT in a row in a row Each row of the image is equal to implementing 1 FFT, after 1d FFT on all the columns of the output from the first pass.
The output of a 2D FFT is similar to the output of a 1D FFT, except that you have complex dimensions in the X, Y dimension, but only one dimension is expected as x and y indexes With the spatial frequency increases.
The FFTW manual () contains a section that covers the organization of real-to-complex 2D FFT output data, assuming that what you are using.
Comments
Post a Comment