On the use of FHT, its modification for practical applications and the structure of Hough image
This work provides incremental improvements to the FHT algorithm, potentially benefiting researchers and practitioners in computer vision and image processing who rely on line detection techniques.
The authors tackled the problem of making the Fast Hough Transform (FHT) more practical by modifying it to compute sums along lines within specific inclination angle ranges and introducing a new visualization method for Hough images based on regrouping accumulator space. They also proved a mathematical property about line transformations using Brady parameterization.
This work focuses on the Fast Hough Transform (FHT) algorithm proposed by M.L. Brady. We propose how to modify the standard FHT to calculate sums along lines within any given range of their inclination angles. We also describe a new way to visualise Hough-image based on regrouping of accumulator space around its center. Finally, we prove that using Brady parameterization transforms any line into a figure of type "angle".