Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Discrete Fourier Transform in 2D
Replies: 2   Last Post: May 7, 2011 10:36 PM

 Messages: [ Previous | Next ]
 Will C. Posts: 1 Registered: 4/15/11
Discrete Fourier Transform in 2D
Posted: Apr 15, 2011 11:36 PM

Hi,

I am trying to creating an algorithm to compute the fourier transform
of a 2D array for use in a program which compares the performance of
image filters in the spatial vs frequency domain.

Part of the transform equation contains the term: exp(-j * 2 * pi *
((u * x) / M + (v * y) /N))

My question is, how can I get a real solution from this? Since u, v,
x, and y are indexes they are positive, and since M and N are the
dimensions of the original array they are also positive.

This leaves something like: exp(-j * c), where c is a positive
constant which is calculated from the above givens. How can I ever
get a real solution from this?

Date Subject Author
4/15/11 Will C.
4/16/11 Dave Dodson
5/7/11 vjp2.at@at.BioStrategist.dot.dot.com