A Fast Discrete Approximation Algorithm for the Radon Transform

Authors:
Martin L. Brady
Affiliations:
-
Venue:
SIAM Journal on Computing
Year:
1998

Citing 0
Cited 10

Radon Transform for Lineal Symbol Representation

ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
Discrete analytical Ridgelet transform

Signal Processing - Signal processing in communications
Randomized radon transforms for biometric authentication via fingerprint hashing

Proceedings of the 2007 ACM workshop on Digital Rights Management
Invariant pattern recognition using radon, dual-tree complex wavelet and Fourier transforms

Pattern Recognition
A novel image hash algorithm resistant to print-scan

Signal Processing
An expert system based on wavelet transform and radon neural network for pavement distress classification

Expert Systems with Applications: An International Journal
An optimum feature extraction method based on Wavelet-Radon Transform and Dynamic Neural Network for pavement distress classification

Expert Systems with Applications: An International Journal
Invariant pattern recognition using the RFM descriptor

Pattern Recognition
The generalization of the R-transform for invariant pattern representation

Pattern Recognition
Sinogram denoising of cryo-electron microscopy images

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses fast parallel methods for the computation of the Radon (or Hough) transform. The Radon transform of an image is a set of projections of the image taken at different angles. Its computation is important in image processing and computer vision for problems such as pattern recognition and reconstruction of medical images. A unique new method for combining partial results is presented, from which an algorithm is constructed that computes a provably good approximation to the discrete Radon transform. The approximate discrete Radon transform (ADRT) algorithm computes 4, N - 4 projections through an $N \times N$ image in time $O(N^2\mathrm{lg}N)$ (the majority of previous algorithms are O(N 3,)). The method is quite simple and easy to parallelize. A parallel version of the ADRT requires only $O(\mathrm{lg}N)$ parallel steps on O(N 2) processors, ignoring communication time. An additional property of the algorithm is that it can be applied directly to compute the backprojection step of the inverse RT.