How does one do the Discrete Fourier Transformation of an image using haskell. I believe the two libraries repa-devil and repa-fftw could be helpful, but I do not know how to integrate them. The reason why I would like this is so I could experiment with hybrid images (I have the wonderful idea that instead of filtering the images separately and then averaging them, I could simply do a weighted average based on frequency.)
Note: Also once one has done this, how would one reinterpret it as an image.
Note: I am not actually sure how one exactly applies dft the image processing. I have seen the equations and know how one would evaluate them, and know the "meaning" for 1D and a rough idea for 2D. I also know how one can some how use it to filter out high or low "frequencies" of an image somehow. I just am not sure exactly how complex frequency images are generated using dft.