{"type":"ScholarlyArticle","title":"Advanced Hough Transform Implementations","authors":[{"name":"Christopher M. Brown","slug":"christopher-m-brown","given":"Christopher M.","family":"Brown","affiliation":""},{"name":"Matthew B. Curtiss","slug":"matthew-b-curtiss","given":"Matthew B.","family":"Curtiss","affiliation":""},{"name":"David B. Sher","slug":"david-b-sher","given":"David B.","family":"Sher","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1983/251","pdf":"https://ijcai.org/proceedings/1983/0251.pdf","markdown":"https://ijcai.org/proceedings/1983/251.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/251","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Vision","track":"Vision","number":251,"pages":{"first":1081,"last":1084},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}