A fast digital radon transform—an efficient means for evaluating the hough transform

摘要

A fast digital Radon transform based on recursively defined digital straight lines is described, which has the sequential complexity of 0(N' 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.