Adaptive Termination of Voting in the Probabilistic Circular Hough Transform

Antti YlaJaaski, Nahum Kiryati

Research output: Contribution to journalArticlepeer-review

Abstract

Reliable detection of objects using the Hough Transform is often possible even if just a small random poll of edge points is used for voting. This can lead to significant computational savings. To reduce the risk of errors, it is customary to preset the poll size to a value that is much larger than necessary in average conditions. Adaptive setting of the poll size in the probabilistic Hough Transform is suggested. It is experimentally demonstrated that by monitoring changes in the ranks of peaks in the parameter space, sensible decisions on voting termination can be made. Adaptive stopping leads to polls that are in average smaller than the fixed poll that leads to the same error rate. In many applications the number of objects to be detected is unknown. Finding the number of appearances of an object in a noisy image is difficult, especially with partial data. We present an adaptive stopping rule that terminates voting as soon as any number of objects seem to be reliably detected, even though the existence of others may not be ruled out yet.

Original languageEnglish
Pages (from-to)911-915
Number of pages5
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Volume16
Issue number9
DOIs
StatePublished - Sep 1994
Externally publishedYes

Keywords

  • Adaptive algorithms
  • probabilistic hough transform
  • stopping rules

Fingerprint

Dive into the research topics of 'Adaptive Termination of Voting in the Probabilistic Circular Hough Transform'. Together they form a unique fingerprint.

Cite this