Fast approximate discrete Radon transform for NumPy arrays.
- Documentation: https://adrt.readthedocs.io/en/latest/
- Source Code: https://github.com/karlotness/adrt
- Bug Reports: https://github.com/karlotness/adrt/issues
This library provides an implementation of an approximate discrete Radon transform (ADRT) and related routines as a Python module operating on NumPy arrays. Implemented routines include: the forward ADRT, a back-projection operation, and several inverse transforms. The package documentation contains usage examples, and sample applications.
Install from PyPI using pip:
$ python -m pip install adrt
or from conda-forge:
$ conda install -c conda-forge adrt
For further details on installation or building from source, consult the documentation.
If you use this software in your research, please cite our associated JOSS paper.
@article{adrt,
title={adrt: approximate discrete {R}adon transform for {P}ython},
author={Karl Otness and Donsub Rim},
journal={Journal of Open Source Software},
publisher={The Open Journal},
year=2023,
doi={10.21105/joss.05083},
url={https://doi.org/10.21105/joss.05083},
volume=8,
number=83,
pages=5083,
}
This implementation is based on descriptions in several publications:
- Martin L. Brady, A Fast Discrete Approximation Algorithm for the Radon Transform Related Databases, SIAM Journal on Computing, 27.
- William H. Press, Discrete Radon transform has an exact, fast inverse and generalizes to operations other than sums along lines, Proceedings of the National Academy of Sciences, 103.
- Donsub Rim, Exact and fast inversion of the approximate discrete Radon transform from partial data, Applied Mathematics Letters, 102.
This software is distributed under the 3-clause BSD license. See LICENSE.txt for the license text.
We also make available several pre-built binary copies of this software. The binary build for Windows includes additional license terms for runtime code included as part of the software. Review the LICENSE.txt file in the binary build package for more information.