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

November 14, 2018 Β· Declared Dead Β· πŸ› International Conference on Machine Vision

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors M. Aliev, E. I. Ershov, D. P. Nikolaev arXiv ID 1811.06378 Category eess.IV: Image & Video Processing Cross-listed cs.CV Citations 10 Venue International Conference on Machine Vision Last Checked 4 months ago
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".
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Image & Video Processing

Died the same way β€” πŸ‘» Ghosted