Advertisement

A Discrete Modulo N Projective Radon Transform for N × N Images

  • Andrew Kingston
  • Imants Svalbe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3429)

Abstract

This paper presents a Discrete Radon Transform (DRT) based on congruent mathematics that applies to N × N arrays where \(N \in \mathcal{N}\). This definition incorporates and is a natural extension of the more restricted cases of the finite Radon transform [1] where N must be prime, the discrete periodic Radon transform [2] where N must be a power of 2, and the DRT over p n [3], where N must be a power of a single prime. The DRT exactly and invertibly maps a 2-D image to a set of 1-D projections of length N. Projections are found as the sum of the pixels centred on a parallel set of discrete lines. The image is assumed to be periodic and these lines wrap around the array under modulo N arithmetic. Properties of the continuous Radon transform are preserved in the DRT; a discrete form of the Fourier slice theorem applies, as does the convolution property. A formula is given to find the projection set required to be exactly invertible for arrays with N any composite number, as well as a means to determine the level of redundancy in sampling that is introduced on such composite arrays.

Keywords

Discrete Form Inversion Process Projection Angle Radon Transform Short Vector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Matus, F., Flusser, J.: Image representation via a finite Radon transform. IEEE Transactions on Pattern Analysis & Machine Intelligence 15, 996–1006 (1993)CrossRefGoogle Scholar
  2. 2.
    Hsung, T., Lun, D., Siu, W.: The discrete periodic Radon transform. IEEE Transactions on Signal Processing 44, 2651–2657 (1996)CrossRefGoogle Scholar
  3. 3.
    Kingston, A.: Orthogonal discrete Radon transform over p n. Signal Processing (submitted November 2003)Google Scholar
  4. 4.
    Beylkin, G.: Discrete radon transform. IEEE Transactions on Acoustics, Speech, & Signal Processing 35, 162–172 (1987)CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    Svalbe, I., van der Spek, D.: Reconstruction of tomographic images using analog projections and the digital Radon transform. Linear Algebra and Its Applications 339, 125–145 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kingston, A., Svalbe, I.: Adaptive discrete Radon transforms for grayscale images. In: Electronic Notes in Discrete Mathematics, vol. 12, Elsevier, Amsterdam (2003)Google Scholar
  7. 7.
    Lun, D., Hsung, T., Shen, T.: Orthogonal discrete periodic Radon transform. Part I: theory and realization. Signal Processing 83, 941–955 (2003)zbMATHCrossRefGoogle Scholar
  8. 8.
    Rote, G.: Finding the shortest vector in a two dimensional lattice modulo m. Theoretical Computer Science 172, 303–308 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Svalbe, I., Kingston, A.: Farey sequences and discrete Radon transform projection angles. In: Electronic Notes in Discrete Mathematics, vol. 12, Elsevier, Amsterdam (2003)Google Scholar
  10. 10.
    Hardy, G., Wright, E.: An introduction to the theory of numbers, 5th edn. Clarendon Press, Oxford (1979)zbMATHGoogle Scholar
  11. 11.
    Kak, A., Slaney, M.: Principles of Computerized Tomographic Imaging. IEEE Computer Society Press, Los Alamitos (1988)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Andrew Kingston
    • 1
  • Imants Svalbe
    • 1
  1. 1.Centre for X-ray Physics and Imaging, School of Physics and Materials EngineeringMonash UniversityAUS

Personalised recommendations