using discrete FT with iradon

조회 수: 3 (최근 30일)
Matthew O'Brien
Matthew O'Brien 2011년 5월 25일
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

채택된 답변

Steve Eddins
Steve Eddins 2011년 5월 25일
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
Steve Eddins
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
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?

댓글을 달려면 로그인하십시오.

추가 답변 (0개)

카테고리

Help CenterFile Exchange에서 Hilbert and Walsh-Hadamard Transforms에 대해 자세히 알아보기

태그

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by