Abstract
The multi-scale discrete Radon transform (DRT) calculates, with linearithmic complexity, the summation of pixels, through a set of discrete lines, covering all possible slopes and intercepts in an image, exclusively with integer arithmetic operations. An inversion algorithm exists and is exact and fast, in spite of being iterative. In this work, the DRT forward and backward pair is evolved to propose two faster algorithms: central DRT, which computes only the central portion of intercepts; and periodic DRT, which computes the line integrals on the periodic extension of the input. Both have an output of size N×4N, instead of 3N×4N, as in the original algorithm. Periodic DRT is proven to have a fast inversion, whereas central DRT does not. An interesting application of periodic DRT is its use as building a block of discrete curvelet transform. Central DRT can provide almost a 2× speedup over conventional DRT, probably becoming the faster Radon transform algorithm available, at the cost of ignoring 15% of the summations in the corners.
Funder
University of La Laguna
Agencia Canaria de Investigación, Innovación y Sociedad de la Información
Wooptix S.L.
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference42 articles.
1. Über die Bestimmung von Funktionen durch ihre Integralwerte längs gewisser Mannigfaltigkeiten;Radon;Akad. Wiss.,1917
2. The Nobel Prize in Physiology or Medicine. Nobel Prize Outreach AB 2021
https://www.nobelprize.org/prizes/medicine/1979/summary/
3. Principles of Computerized Tomographic Imaging;Kak,2001
4. Relative Altitude Estimation Using Omnidirectional Imaging and Holistic Descriptors
5. Finger-vein verification based on the curvature in Radon space