By Topic

Deriving stopping rules for the probabilistic Hough transform by sequential analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shaked, D. ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; Yaron, O. ; Kiryati, N.

In probabilistic Hough transforms computation is accelerated by polling instead of voting. A small part of the data set is selected at random and used as input to the algorithm. Most probabilistic Hough algorithms use a fixed poll size. It has been experimentally demonstrated that adaptive termination of voting can lead to improved performance in terms of the error rate versus average poll size tradeoff. However, the lack of a solid theoretical foundation made general performance evaluation and optimal design of adaptive stopping rules nearly impossible. In this paper we suggest two novel adaptive stopping rules in the framework of the statistical theory of sequential hypothesis testing. The performance of the suggested stopping rules is verified using real images. It is shown that the extension suggested in this paper to Wald's one sided alternative sequential test (1947) performs better than previously available adaptive (or fixed) stopping rules

Published in:

Pattern Recognition, 1994. Vol. 2 - Conference B: Computer Vision & Image Processing., Proceedings of the 12th IAPR International. Conference on  (Volume:2 )

Date of Conference:

9-13 Oct 1994