## Abstract

This paper examines how the minimal set of digital projection angles for the Discrete Radon Transform (DRT) is selected from the known sequence of Farey fractions. A square array of prime size p defines a unique direction for each digital projection, m, through an integer ratio x_{m}/y_{m}. Here x_{m} and y_{m} define the nearest neighbour distance, d_{m}, between projection samples under a modulus p sampling rule. We show the maximum gap length, d_{max}, on square and hexagonal lattices is < √(2p/√3) and ≤ √p respectively. The DRT angles are shown to replicate the entire Farey fraction sequence over the interval 1 ≤ d_{m} ≤ √p for a square lattice. For the interval √p < d_{m} < d_{max}, the DRT set skips some Farey angles. The skipping of Farey angles is the result of a geometric restriction on the distance minimisation process. The DRT angle set varies significantly with p for those projections with d_{m} near d_{max}. This complicates the comparison of DRT projections over similar sized arrays. The detailed angle distributions of the DRT and the Farey sequences reflect, in different ways, the variable gaps between prime numbers. Thanks are due to Graham Farr, Computer Science, Monash University, for pointing us to the literature on finding minimal vectors in lattices. IS acknowledges support from the Centre for X-Ray Physics and Imaging for this project. AK is a Monash University postgraduate student in receipt of an Australian Postgraduate Award scholarship, provided through the Australian Government.

Original language | English |
---|---|

Pages (from-to) | 154-165 |

Number of pages | 12 |

Journal | Electronic Notes in Discrete Mathematics |

Volume | 12 |

DOIs | |

Publication status | Published - Mar 2003 |

Externally published | Yes |