Sketch based Reduced Memory Hough Transform
This addresses memory efficiency for computer vision practitioners using Hough transforms, but it is incremental as it builds on known sketch techniques.
The paper tackles the high memory usage of Hough transforms by replacing the accumulator array with sketch algorithms, resulting in a Sketch Hough Transform (SHT) that significantly reduces memory requirements, and introduces a new Count Median Update sketch that outperforms existing methods for this application.
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.