Monday, July 22, 2019

image processing - Fourier transform 4 times = original function (2D and higher)


The Signal Processing SE post linked below shows how the Fourier Transform applied 4 times to a 1D function returns the original function, i.e. F{ F{ F{ F{ g(x) } } } } = g(x)


Link to 1D case: Fourier transform 4 times = original function (from Bracewell book)


Can someone prove that this does or doesn't apply to 2D or higher functions? In particular, if I use this method on a grayscale image, will I get back the original image? I know edge effects could be problematic, so lets say the image is a simple repeating pattern so that it is periodic. And yes, numerical/computational FFT issues might mean the image is not exactly like the original, but even if they are similar that would be pretty cool to see....




No comments:

Post a Comment

digital communications - Understanding the Matched Filter

I have a question about matched filtering. Does the matched filter maximise the SNR at the moment of decision only? As far as I understand, ...