This paper extends the domain of the finite radon transform (FRT) to apply to square arrays of arbitrary size. The FRT is a discrete formalism of the Radon transform that assumes the …
The discrete periodic radon transform (DPRT) has extensively been used in applications that involve image reconstructions from projections. Beyond classic applications, the DPRT can …
G Ma, H Li, J Zhao - IEEE Transactions on Quantum …, 2021 - ieeexplore.ieee.org
This article extends the Radon transform, a classical image-processing tool for fast tomography and denoising, to the quantum computing platform. A new kind of periodic …
The manuscript describes fast and scalable architectures and associated algorithms for computing convolutions and cross-correlations. The basic idea is to map 2D convolutions …
J Zhu, X Li, Y Ye, G Wang - Discrete Applied Mathematics, 2008 - Elsevier
Discrete tomography deals with image reconstruction of an object with finitely many gray levels (such as two). Different approaches are used to model the raw detector reading. The …
Although x-ray tomography is commonly used to characterize the three-dimensional structure of materials, sometimes this is impractical due either to limited time for data …
In this letter, we demonstrate how characteristics of a permutation of the Hadamard transform (HT), known as the binary discrete Hartley transform (BDHT), can be leveraged to …
The Mojette transform and the finite Radon transform (FRT) are discrete data projection methods that are exactly invertible and are computed using simple addition operations …
S Chandra, I Svalbe - IET Computer Vision, 2014 - Wiley Online Library
This study presents an integer‐only algorithm to exactly recover an image from its discrete projected views that can be computed with the same computational complexity as the fast …