Fast Algorithms and Efficient GPU Implementations for the Radon Transform and the Back-Projection Operator Represented as Convolution Operators
DOI10.1137/15M1023762zbMath1346.65070arXiv1506.00014OpenAlexW2221433403MaRDI QIDQ3188200
Viktor V. Nikitin, Marcus Carlsson, Fredrik Andersson
Publication date: 17 August 2016
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.00014
interpolationconvolutionRadon transformfast algorithmsfast Fourier transform (FFT)back-projection operatorFourier-based gridding methodsgraphical processor units (GPUs)
Radon transform (44A12) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for integral transforms (65R10) Numerical methods for inverse problems for integral equations (65R32)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast and accurate polar Fourier transform
- A note on fast Fourier transforms for nonequispaced grids
- 3D Fourier based discrete Radon transform.
- High-order quadratures for integral operators with singular kernels
- On the fast Fourier transform of functions with singularities
- O(N/sup 2/log/sub 2/N) filtered backprojection reconstruction algorithm for tomography
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- A Fast and Accurate Multilevel Inversion of the Radon Transform
- Fast Inversion of the Radon Transform Using Log-polar Coordinates and Partial Back-Projections
- Nonuniform fast fourier transforms using min-max interpolation
- Fast Tomographic Reconstruction via Rotation-Based Hierarchical Backprojection
- Characterization and reduction of artifacts in limited angle tomography
This page was built for publication: Fast Algorithms and Efficient GPU Implementations for the Radon Transform and the Back-Projection Operator Represented as Convolution Operators
