A new linogram algorithm for computerized tomography
From MaRDI portal
The authors propose a new linogram algorithm for the high quality Fourier reconstruction of digital \(N\times N\) images from their Radon transform. The algorithm is based on univariate fast Fourier transforms for nonequispaced data in the time domain and in the frequency domain. The algorithm requires only \(O(N^2\log N)\) arithmetic operations and preserves the good reconstruction quality of the filtered backprojection.
Recommendations
Cited in
(13)- Fourier reconstruction in tomography
- Approximate factorizations of Fourier matrices with nonequispaced knots
- Reconstructing a function on the sphere from its means along vertical slices
- Linear regularization algorithms for computer tomography
- scientific article; zbMATH DE number 2059033 (Why is no real title available?)
- scientific article; zbMATH DE number 1373505 (Why is no real title available?)
- The discrete Fourier transform for golden angle linogram sampling
- Total variation-based reconstruction and phase retrieval for diffraction tomography
- Discrete Geometry for Computer Imagery
- scientific article; zbMATH DE number 5054997 (Why is no real title available?)
- Diffraction tomography, Fourier reconstruction, and full waveform inversion
- On the computation of the polar FFT
- Numerical stability of nonequispaced fast Fourier transforms
This page was built for publication: A new linogram algorithm for computerized tomography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2748869)