Advanced Hough Transform Implementations
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Vision. Pages 1081-1084.
Abstract
In the Hough transform, a feature in an input sp _ ace I votes for parameters in a transform space P with which It is compatible. If it also uses negative votes to vote agai~st parameters with which it is incompatible, background bias and inherent noise in P can be reduced and peaks sharpened. In the usual Hough transform implementation. an array is used to accumulate votes, raising the problem that the space requirement increases exponentially with the number of parameters. Accumulation in a fixedsize content-addressable cache (or hash table) may provide a solution.
@inproceedings{ijcai1983p251,
title = {Advanced Hough Transform Implementations},
author = {Brown, Christopher M. and Curtiss, Matthew B. and Sher, David B.},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {1081--1084},
year = {1983},
note = {Vision},
url = {https://ijcai.org/proceedings/1983/251},
}
TY - CPAPER TI - Advanced Hough Transform Implementations AU - Brown, Christopher M. AU - Curtiss, Matthew B. AU - Sher, David B. T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 1081 EP - 1084 UR - https://ijcai.org/proceedings/1983/251 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
