
Proceedings Paper
On the use of FHT, its modification for practical applications and the structure of Hough imageFormat | Member Price | Non-Member Price |
---|---|---|
$17.00 | $21.00 |
Paper 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”.
Paper Details
Date Published: 15 March 2019
PDF: 9 pages
Proc. SPIE 11041, Eleventh International Conference on Machine Vision (ICMV 2018), 1104119 (15 March 2019); doi: 10.1117/12.2522803
Published in SPIE Proceedings Vol. 11041:
Eleventh International Conference on Machine Vision (ICMV 2018)
Antanas Verikas; Dmitry P. Nikolaev; Petia Radeva; Jianhong Zhou, Editor(s)
PDF: 9 pages
Proc. SPIE 11041, Eleventh International Conference on Machine Vision (ICMV 2018), 1104119 (15 March 2019); doi: 10.1117/12.2522803
Show Author Affiliations
M. Aliev, Federal Research Ctr. (Russian Federation)
Smart Engines Ltd. (Russian Federation)
E. I. Ershov, The Institute for Information Transmission Problems (Russian Federation)
Smart Engines Ltd. (Russian Federation)
E. I. Ershov, The Institute for Information Transmission Problems (Russian Federation)
D. P. Nikolaev, The Institute for Information Transmission Problems (Russian Federation)
Smart Engines Ltd. (Russian Federation)
Smart Engines Ltd. (Russian Federation)
Published in SPIE Proceedings Vol. 11041:
Eleventh International Conference on Machine Vision (ICMV 2018)
Antanas Verikas; Dmitry P. Nikolaev; Petia Radeva; Jianhong Zhou, Editor(s)
© SPIE. Terms of Use
