A MORE EFFICIENT CONSTANT TIME ALGORITHM FOR COMPUTING THE HOUGH TRANSFORM

Abstract

An efficient Hough transform algorithm on a reconfigurable mesh is proposed in this paper. For a problem with N edge pixels and an n×n parameter space, our algorithm runs in constant time on a 4-dimensional N× log 2N×n×n reconfigurable mesh. The previous best algorithm for the same problem runs in a constant time on a 4-dimensional n×N×N×N reconfigurable mesh. Since n is always smaller than N in real world (in fact, n is in the order of N1/2), our algorithm reduces the number of processors used drastically while keeping the same time complexity.