On the use of FHT, its modification for practical applications and the structure of Hough image
Image and Video Processing
2019-03-26 v1 Computer Vision and Pattern Recognition
Abstract
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".
Keywords
Cite
@article{arxiv.1811.06378,
title = {On the use of FHT, its modification for practical applications and the structure of Hough image},
author = {M. Aliev and E. I. Ershov and D. P. Nikolaev},
journal= {arXiv preprint arXiv:1811.06378},
year = {2019}
}
Comments
8 pages, 8 figures. Submitted and presented at ICMV 2018