Sketch based Reduced Memory Hough Transform

11/15/2018
by   Levi Offen, et al.
0

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.

READ FULL TEXT

page 1

page 2

research
04/11/2017

A Neural Representation of Sketch Drawings

We present sketch-rnn, a recurrent neural network (RNN) able to construc...
research
07/25/2022

TreeSketchNet: From Sketch To 3D Tree Parameters Generation

3D modeling of non-linear objects from stylized sketches is a challenge ...
research
06/21/2021

Efficient Inference via Universal LSH Kernel

Large machine learning models achieve unprecedented performance on vario...
research
05/23/2022

HyperLogLogLog: Cardinality Estimation With One Log More

We present HyperLogLogLog, a practical compression of the HyperLogLog sk...
research
11/11/2020

Sketch and Scale: Geo-distributed tSNE and UMAP

Running machine learning analytics over geographically distributed datas...
research
11/07/2017

Finding Heavily-Weighted Features in Data Streams

We introduce a new sub-linear space data structure---the Weight-Median S...
research
05/29/2019

Recursive Sketches for Modular Deep Learning

We present a mechanism to compute a sketch (succinct summary) of how a c...

Please sign up or login with your details

Forgot password? Click here to reset