using discrete FT with iradon

3 visualizzazioni (ultimi 30 giorni)
Matthew O'Brien
Matthew O'Brien il 25 Mag 2011
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

Risposta accettata

Steve Eddins
Steve Eddins il 25 Mag 2011
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 Commenti
Steve Eddins
Steve Eddins il 26 Mag 2011
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 il 14 Giu 2011
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?

Accedi per commentare.

Più risposte (0)

Tag

Community Treasure Hunt

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

Start Hunting!

Translated by