Sketch Based Reduced Memory Hough Transform

Levi Offen, Michael Werman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication2018 IEEE International Conference on Image Processing, ICIP 2018 - Proceedings
PublisherIEEE Computer Society
Pages664-668
Number of pages5
ISBN (Electronic)9781479970612
DOIs
StatePublished - 29 Aug 2018
Event25th IEEE International Conference on Image Processing, ICIP 2018 - Athens, Greece
Duration: 7 Oct 201810 Oct 2018

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Conference

Conference25th IEEE International Conference on Image Processing, ICIP 2018
Country/TerritoryGreece
CityAthens
Period7/10/1810/10/18

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

Keywords

  • Hough transform
  • Image processing
  • Line detection
  • Memory Saving
  • Random mapping
  • Sketch

Fingerprint

Dive into the research topics of 'Sketch Based Reduced Memory Hough Transform'. Together they form a unique fingerprint.

Cite this