Abstract
This paper proposes using sketch algorithms to represent the votes in Hough transforms. Replacing the accumulator array with a sketch (Sketch Hough Transform - SHT) significantly reduces the memory needed to compute a Hough transform. We also present a new sketch, Count Median Update, which works better than known sketch methods for replacing the accumulator array in the Hough Transform.
Original language | English |
---|---|
Title of host publication | 2018 IEEE International Conference on Image Processing, ICIP 2018 - Proceedings |
Publisher | IEEE Computer Society |
Pages | 664-668 |
Number of pages | 5 |
ISBN (Electronic) | 9781479970612 |
DOIs | |
State | Published - 29 Aug 2018 |
Event | 25th IEEE International Conference on Image Processing, ICIP 2018 - Athens, Greece Duration: 7 Oct 2018 → 10 Oct 2018 |
Publication series
Name | Proceedings - International Conference on Image Processing, ICIP |
---|---|
ISSN (Print) | 1522-4880 |
Conference
Conference | 25th IEEE International Conference on Image Processing, ICIP 2018 |
---|---|
Country/Territory | Greece |
City | Athens |
Period | 7/10/18 → 10/10/18 |
Bibliographical note
Publisher Copyright:© 2018 IEEE.
Keywords
- Hough transform
- Image processing
- Line detection
- Memory Saving
- Random mapping
- Sketch