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
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Image & Video Processing
R.I.P.
π»
Ghosted
π
π
The Cartographer
Deep Learning for Hyperspectral Image Classification: An Overview
R.I.P.
π»
Ghosted
U-Net and its variants for medical image segmentation: theory and applications
R.I.P.
π»
Ghosted
Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processing
R.I.P.
π
404 Not Found
Lightweight Image Super-Resolution with Information Multi-distillation Network
R.I.P.
π»
Ghosted
Deep Learning on Image Denoising: An overview
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted