The discrete periodic Radon transform

In this correspondence, a discrete periodic Radon transform and its inversion are developed. The new discrete periodic Radon transform possesses many properties similar to the continuous Radon transform such as the Fourier slice theorem and the convolution property, etc. With the convolution property, a 2-D circular convolution can be decomposed into 1-D circular convolutions, hence improving the computational efficiency. Based on the proposed discrete periodic Radon transform, we further develop the inversion formula using the discrete Fourier slice theorem. It is interesting to note that the inverse transform is multiplication free. This important characteristic not only enables fast inversion but also eliminates the finite-word-length error that may be generated in performing the multiplications.

[1]  Mario Policastro,et al.  A simple algorithm to perform the bilinear transformation , 1979 .

[2]  Y. Tsay,et al.  A new formula for the discrete-time system stability test , 1977, Proceedings of the IEEE.

[3]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[4]  Gregory Beylkin,et al.  Discrete radon transform , 1987, IEEE Trans. Acoust. Speech Signal Process..

[5]  Ethan D. Bolker,et al.  The finite Radon transform , 1987 .

[6]  James A. Heinen,et al.  A simple algorithm for arbitrary polynomial transformation , 1988, IEEE Trans. Acoust. Speech Signal Process..

[7]  Jan Flusser,et al.  Image Representation Via a Finite Radon Transform , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  W. N. Waggener,et al.  Recursive algorithms for polynomial transformations , 1980, IEEE Circuits & Systems Magazine.

[9]  Stephen Barnett,et al.  Bilinear transformation of multivariable polynomials using the Horner method , 1983 .

[10]  Vijay K. Madisetti,et al.  The fast discrete Radon transform. I. Theory , 1993, IEEE Trans. Image Process..

[11]  Ronald L. Graham,et al.  THE RADON TRANSFORM ON Z , 1985 .

[12]  S. Barnett,et al.  Transformation matrices in the general bilinear transformation of multivariable polynomials , 1984 .

[13]  Stephen Barnett,et al.  Some applications of matrices to location of zeros of polynomials , 1973 .

[14]  Izidor Gertner A new efficient algorithm to compute the two-dimensional discrete Fourier transform , 1988, IEEE Trans. Acoust. Speech Signal Process..

[15]  Joseph P. S. Kung,et al.  Reconstructing finite radon transforms , 1988 .

[16]  Ronald L. Graham,et al.  The Radon transform on $Z^k_2$. , 1985 .