It was one of the first things I tried, without success
Nadav.
-הודעה מקורית-
מאת: numpy-discussion-boun...@scipy.org בשם Anne Archibald
נשלח: ה 05-מרץ-09 22:06
אל: Discussion of Numerical Python
נושא: Re: [Numpy-discussion] Interpolation via Fourier transform
2009/3/5 M Trumpis
Hi Nadav
You can also read the interesting discussion at
http://projects.scipy.org/numpy/ticket/748
which also contains some padding code.
I still disagree with the conclusion, but oh well :)
Cheers
Stéfan
2009/3/6 Nadav Horesh :
> I found the solution I needed for my peculiar case after read
umerical Python
נושא: Re: [Numpy-discussion] Interpolation via Fourier transform
Hi Nadav.. if you want a lower resolution 2d function with the same
field of view (or whatever term is appropriate to your case), then in
principle you can truncate your higher frequencies and do this:
sig = ifft2_fu
2009/3/5 M Trumpis :
> Hi Nadav.. if you want a lower resolution 2d function with the same
> field of view (or whatever term is appropriate to your case), then in
> principle you can truncate your higher frequencies and do this:
>
> sig = ifft2_func(sig[N/2 - M/2:N/2 + M/2, N/2 - M/2:N/2+M/2])
>
>
Hi Nadav.. if you want a lower resolution 2d function with the same
field of view (or whatever term is appropriate to your case), then in
principle you can truncate your higher frequencies and do this:
sig = ifft2_func(sig[N/2 - M/2:N/2 + M/2, N/2 - M/2:N/2+M/2])
I like to use an fft that transfo
I apology for this off topic question:
I have a 2D FT of size N x N, and I would like to reconstruct the original
signal with a lower sampling frequency directly (without using an interpolation
procedure): Given M < N the goal is to compute a M x M "time domain" signal.
In the case of 1D sig
