Image Representation Via a Finite Radon Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Orthogonal discrete periodic Radon transform: part II: applications
Signal Processing
The discrete periodic Radon transform
IEEE Transactions on Signal Processing
Generalised finite radon transform for N x N images
Image and Vision Computing
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
A discrete modulo N projective radon transform for N × N images
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
This paper presents a discrete Radon transform based on arrays of size pn × pn where p is prime (p ≥ 2) and n ∈ N. The finite Radon transform presented in [F. Matus, J. Flusser, Image representation via a finite Radon transform, IEEE Trans. Pattern Anal. Mach. Intell. 15 (10) (1993) 996-1006] and the discrete periodic Radon transform (DPRT) presented in [T. Hsung, D. Lun, W. Siu, The discrete periodic Radon transform, IEEE Trans. Signal Process. 44 (10) (1996) 2651-2657] are subsets of this more general transform with n restricted to 1 and p restricted to 2, respectively. This transform exactly and invertibly maps the image as pn + pn-1 projections of length pn wrapped under modulo pn arithmetic. Since pn has factors if n ≥ 1, this mapping is partly redundant and a version utilising orthogonal bases is required. An invertible form of the DPRT with orthogonal bases, the orthogonal DPRT (ODPRT), was developed in [D. Lun, T. Hsung, T. Shen, Orthogonal discrete periodic Radon transform. Part I: theory and realization, Signal Processing 83 (5) (2003) 941-955]. An orthogonal version for the generalised pn case is developed here with applications analogous to those of the ODPRT presented in [D. Lun, T. Hsung, T. Shen, Orthogonal discrete periodic Radon transform, Part II: applications, Signal Processing 83 (5) (2003) 957-971].