2-Dimensional Discrete-Space Fourier Transform

preview_player
Показать описание
2D discrete-space Fourier transform, the convolution-multiplication property, discrete-space sinusoids, 2D DFT, 2D circular convolution, and fast computation of the 2D DFT.
Рекомендации по теме
Комментарии
Автор

Wow, thank you for that. I'm doing an internship with radio interferometers and this helped me understand the stuff tremendously. Thank you!

Stucky
Автор

Great. Fftshift was what I was missing. Great explanantion.

harshjain
Автор

Thank you so much for making this video!

cooper
Автор

DSP final exam coming up. Thank you for taking time to make this video.

brevin-tilmon
Автор

I had a stroke when he said v is the horizontal frequency...

jcgongavoe
Автор

You are a fantastic human begin. Thank you.

allistermason
Автор

You are awesome !!! Thank-you very much for the easy explanation.

vikaschoudhary
Автор

You are great! Now I understand WAY better!!!! 

Daniel-enbt
Автор

Thank you so much for this great lecture!

johnsonkuan
Автор

Great video and great explanation. I'm new to this topic and tried to visualizza the Fourier Transform of the photographer like you show at min 5:45. I've tried with Octave, Scikit image and Numpy, using fft, fft2 and fftn. Couldn't get the same result, mine doesn't get even close to that. I'm transforming the image into a float skimage.image_as_float(), then calculating the fft and printing it with mathplotlib.pylab with
Am I doing something wrong? Thanks

pantich
Автор

Barry, If I have a picture of Fourier Plane, How I can get a picture original?

luismolina
Автор

Excellent Video
I had confusion what Fourier Transform to do in Image domain?
how image pixels forms wave form?

those fundamentals are cleared and got little more than that
Now I'll go back to my book and revise in the light of your explanation
thanks a lot :D

ShankhaAcharya
Автор

Bro, thnks so much! this helped me a lot with the Uni!

paraescucharrap
Автор

excellent videos!  i love them!  and i have a question.

i am using this to convolve an 80x120 image with a 30x30 kernel.  it's very fast compared to the slower pixel by pixel approach, but i tend to get over saturated images.  for example, 3/4 of a convolved image is pure white.

i suspect that that this is a scaling issue, because it would happen using the slow convolve approach unless i divided the sum of the convolved pixel by the width*height of the kernel i used.

i am trying to figure out how to scale down the pixels when using dft to convolve an image.  

any ideas?

antonbursch
Автор

What does - sign signifies in the formula

mansukhkaur
Автор

Could you please tell me what does the value F(u, v) corresponds to in frequency domain? The amplitude?

NHK
Автор

You are awesome !!! Thank-you very much for the easy explanation.

vikaschoudhary