pith. sign in

arxiv: 1811.06287 · v1 · pith:JT5SIRXKnew · submitted 2018-11-15 · 💻 cs.CV

Sketch based Reduced Memory Hough Transform

classification 💻 cs.CV
keywords sketchhoughtransformaccumulatorarraymemoryreplacingalgorithms
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.