using discrete FT with iradon

Question

Matthew O'Brien 2011-5-25

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/8162-using-discrete-ft-with-iradon

Dear all,

according to the matlab documentation:

'iradon uses the filtered back-projection algorithm to perform the inverse Radon transform. The filter is designed directly in the frequency domain and then multiplied by the FFT of the projections.'

I want however to try and do the procedure using discrete FT and not fast FT. Does anyone know of how to do this?

Thanks

Matt

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Steve Eddins 2011-5-25

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/8162-using-discrete-ft-with-iradon#answer_11228

Fast Fourier transform, or FFT, refers to a family of fast algorithms for computing the discrete Fourier transform, or DFT. See these blog posts for information about different kinds of Fourier transforms and the relationships between them.

3 个评论
显示 1更早的评论隐藏 1更早的评论

Steve Eddins 2011-5-26

No. You could try the different filtering and interpolation options with iradon. However, the idea that there is a difference between a "full DFT" and what the MATLAB fft function calculates is simply incorrect.

Matthew O'Brien 2011-6-14

Hi Steve, I have identified the problem and as you say it has nothing to do with DFT and FFT. Effectively the issue is that the sinogram data i have has a constant 'background' and the actual data is very low compared to this. I can recreate the problem by simply creating a Matrix of 1's which represent the 'sinogram' if this is then inverse radon transformed you get the ring:

sino = ones(20,20);

out = iradon(sino,[],20)

imagesc(out(1:20,1:20)); figure(gcf)

I guess this is a mathematical consequence of trying to perform iradon on data which doesnt contain a real sinogram?

请先登录，再进行评论。