Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

FFT is equivalent to convolution, which is widely used today for object recognition in CNNs.


> FFT is equivalent to convolution

What do you mean by that? Could you give me an example?


The FFT, composed with pointwise multiplication, composed with the inverse FFT, is equivalent to convolution. The FFT is not.



That is something else entirely.


Then if you know what the OP meant why did you ask?


because they made a nonsensical claim that doesn't align with my (and likely their) understanding of what the FT is and does.

The FT is _NOT_ just a convolution, but under certain conditions a specific operation on FT terms is equivalent to a convolution.


I didn't know what they meant. There are so many FFT tricks. I was hoping this was another.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: