# On the use of FHT, its modification for practical applications and the structure of Hough image

arXiv: https://arxiv.org/abs/1811.06378 · HTML: https://mlsanity.com/paper/1811.06378/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Nov 2018.

## Built on by (most cited first, 2 of 2)

- [HoughToRadon Transform: New Neural Network Layer for Features Improvement in Projection Space](https://mlsanity.com/paper/2402.02946/) (2024)
- [A High-Accuracy Fast Hough Transform with Linear-Log-Cubed Computational Complexity for Arbitrary-Shaped Images](https://mlsanity.com/paper/2509.00231/) (2025)

## Abstract (arXiv)

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".