An analysis of hole detection schemes | Zendy

E. R. Davits | Zendy; Simon Peter Barker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An analysis of hole detection schemes

Author(s) -

E. R. Davits,

Simon Peter Barker

Publication year - 1990

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.5244/c.4.51

Subject(s) - histogram , computer science , hough transform , chord (peer to peer) , computer vision , scheme (mathematics) , artificial intelligence , mathematics , image (mathematics) , database , mathematical analysis

This paper studies the intricacies of hole detection, with an emphasis on the efficient location of small holes the ultimate goal being real-time recognition and location of objects from their features. First, methods of locating circles are examined, and then the study is extended to hole location. A new form of chord-bisection scheme is found to be faster than the standard Hough transform for circle location, but the lateral histogram approach turns out to provide the most efficient available vieans for hole location.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research