Abstract
We give an exact inversion formula for the approximate discrete Radon transform introduced in [Brady, SIAM J. Comput., 27(1), 107--119] that is of cost O(N log N) for a square 2D image with N pixels and requires only partial data.
Exact and fast inversion of the approximate discrete Radon transform from partial data
Related papers
Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).
- Efficient Computation of Higher Order 2D Image Moments using the Discrete Radon Transform (2020)54% match
- Generalization of Brady-Yong Algorithm for Fast Hough Transform to Arbitrary Image Size (2024)54% match
- Fast Hough Transform and approximation properties of dyadic patterns (2017)53% match
- A High-Accuracy Fast Hough Transform with Linear-Log-Cubed Computational Complexity for Arbitrary-Shaped Images (2025)52% match
- A Framework for Fast Image Deconvolution with Incomplete Observations (2016)52% match
- Reverse image filtering using total derivative approximation and accelerated gradient descent (2021)51% match
- Deconvolution with a Box (2024)50% match
- Fast and Provably Accurate Bilateral Filtering (2016)50% match