Fast Hough transform: A hierarchical approach
Computer Vision, Graphics, and Image Processing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Natural Representations for Straight Lines and the Hough Transform on Discrete Arrays
IEEE Transactions on Pattern Analysis and Machine Intelligence
Randomized radon transforms for biometric authentication via fingerprint hashing
Proceedings of the 2007 ACM workshop on Digital Rights Management
Rapid determination of particle velocity from space-time images using the Radon transform
Journal of Computational Neuroscience
Advanced Radon transform using generalized interpolated Fourier method for straight line detection
Computer Vision and Image Understanding
Amplitude-only log Radon transform for geometric invariant shape descriptor
Pattern Recognition
| Hi-index | 0.01 |
A fast digital Radon transform based on recursively defined digital straight lines is described, which has the sequential complexity of N^2 log N additions for an N x N image. This transform can be used to evaluate the Hough transform to detect straight lines in a digital image. Whilst a parallel implementation of the Hough transform algorithm is difficult because of global memory access requirements, the fast digital Radon transform is vectorizable and therefore well suited for parallel computation. The structure of the fast algorithm is shown to be quite similar to the FFT algorithm for decimation in frequency. It is demonstrated that even for sequential computation the fast Radon transform is an attractive alternative to the classical Hough transform algorithm.