The enormous growth in the application areas of the Radon Transform and the fact that digital computations are of ten required, has led to the development of the Discrete Radon Transform ( DRT ). This paper proposes a method for computing the DRT by exploiting the converse of the Central Slice Theorem relating the Radon and Fourier Transforms, using the FFT algorithm. Simulation of the DRT algorithm is presented and some applications are discussed. The proposed algorithm can be extended for filtering in the Radon Space
In this paper, we suggest a new Fourier transform based algorithm for the reconstruction of function...
In digital signal processing, the Fast Fourier Transform (FFT) is a kind of high efficient method to...
Abstract. A fast implementation of the OPED algorithm, a reconstruction algorithm for Radon data int...
The enormous growth in the application areas of the Radon Transform and the fact that digital comput...
Abstract-This paper describes the discrete Radon transform (DRT) and the exact inversion algorithm f...
AbstractThe Radon transform is a fundamental tool in many areas. For example, in reconstruction of a...
This study presents an integer-only algorithm to exactly recover an image from its discrete projecte...
In this correspondence a discrete periodic Radon transform and its inversion are developed. The new ...
This paper extends the domain of the finite radon transform (FRT) to apply to square arrays of arbit...
In this paper, we study the properties and possible applications of the newly proposed orthogonal di...
This thesis develops several new algorithms for computing the discrete Fourier transform (DFT). The ...
In this paper, a fast algorithm for the computation of two-dimensional image moments is proposed. In...
The discrete periodic Radon transform (DPRT) was proposed recently. It was shown that DPRT possesses...
AbstractThe Discrete Radon Transform (DRT) provides a 1:1 mapping between any discrete array, for ex...
The Fast Fourier Transform (FFT) algorithm of Cooley and Tukey [7] requires sampling on an equally s...
In this paper, we suggest a new Fourier transform based algorithm for the reconstruction of function...
In digital signal processing, the Fast Fourier Transform (FFT) is a kind of high efficient method to...
Abstract. A fast implementation of the OPED algorithm, a reconstruction algorithm for Radon data int...
The enormous growth in the application areas of the Radon Transform and the fact that digital comput...
Abstract-This paper describes the discrete Radon transform (DRT) and the exact inversion algorithm f...
AbstractThe Radon transform is a fundamental tool in many areas. For example, in reconstruction of a...
This study presents an integer-only algorithm to exactly recover an image from its discrete projecte...
In this correspondence a discrete periodic Radon transform and its inversion are developed. The new ...
This paper extends the domain of the finite radon transform (FRT) to apply to square arrays of arbit...
In this paper, we study the properties and possible applications of the newly proposed orthogonal di...
This thesis develops several new algorithms for computing the discrete Fourier transform (DFT). The ...
In this paper, a fast algorithm for the computation of two-dimensional image moments is proposed. In...
The discrete periodic Radon transform (DPRT) was proposed recently. It was shown that DPRT possesses...
AbstractThe Discrete Radon Transform (DRT) provides a 1:1 mapping between any discrete array, for ex...
The Fast Fourier Transform (FFT) algorithm of Cooley and Tukey [7] requires sampling on an equally s...
In this paper, we suggest a new Fourier transform based algorithm for the reconstruction of function...
In digital signal processing, the Fast Fourier Transform (FFT) is a kind of high efficient method to...
Abstract. A fast implementation of the OPED algorithm, a reconstruction algorithm for Radon data int...