MathGroup Archive 2009

[Date Index] [Thread Index] [Author Index]

Search the Archive

2dFFT & image processing

  • To: mathgroup at
  • Subject: [mg101500] 2dFFT & image processing
  • From: "alexxx.magni at" <alexxx.magni at>
  • Date: Thu, 9 Jul 2009 01:53:01 -0400 (EDT)

hi everybody,
I need to perform a high-pass filter on some images.

I know I can get a high pass filter doing a convolution of the image
with a predefined kernel, but for various reasons (and my learning
too) I wanted to follow the sequence:
1) fft
2) cut away central region (with a smooth edge)
3) fft again

but, due to my ignorance, I'm unable to accomplish the process:

given the image in a, I put:

f = Fourier[a[[1]]];
af = Abs@f;

and I can check the fft with Graphics[Raster[255*af/Max[af]]]

I then create the "hole" and apply it to the fft and invert again:

k = Table[1 - Exp[-(x^2 + y^2)/s], {x, -249, 250}, {y, -249, 250}] /.
s -> 1000.;
holed = af*k;
fholed = Abs[Fourier[holed]];

since the reconstructed image Graphics[Raster[255*fholed/Max[fholed]]]
is strongly fuzzed, whichever value I choose for the parameter s
above, I wanted to ask you if I completely misunderstood the process!

thank you,


  • Prev by Date: Re: Selecting Rows Based on Column Values
  • Next by Date: Re: Selecting Rows Based on Column Values
  • Previous by thread: Re: RecurrenceTable can't finish
  • Next by thread: Re: 2dFFT & image processing