You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I have a strong suspicion, that this is an implementation of a 1D fourier transform, not 2D. Meaning, instead of computing a 2D transform of NxN values, it computes a 1D transform of a "linear array" of NxN values.
The 1D transform of an image (as "row-by-row") looks very similar to a 2D transform. Of course, it is invertable, meaning, that the inverse will give you back the original array, even if it was an image.
I have a strong suspicion, that this is an implementation of a 1D fourier transform, not 2D. Meaning, instead of computing a 2D transform of NxN values, it computes a 1D transform of a "linear array" of NxN values.
The 1D transform of an image (as "row-by-row") looks very similar to a 2D transform. Of course, it is invertable, meaning, that the inverse will give you back the original array, even if it was an image.
This library gives exactly the same results, as this code of 1D transform: https://code.soundsoftware.ac.uk/projects/js-dsp-test/repository/entry/fft/nayuki-obj/fft.js
The text was updated successfully, but these errors were encountered: