mlsanityData to 14 Oct 2026

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

arXiv 1811.06378 ↗First posted 14 Nov 2018eess.IV cs.CVcited by 2

Not on the map. Why?

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

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

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.