Vision Algorithm For Finding Holes

R. Kelley; P. Gouin

doi:10.1117/12.946165

17 January 1985 Vision Algorithm For Finding Holes

R. Kelley, P. Gouin

Proceedings Volume 0521, Intelligent Robots and Computer Vision; (1985) https://doi.org/10.1117/12.946165
Event: 1984 Cambridge Symposium, 1984, Cambridge, United States

Abstract

Usually, to find a hole in an image, its shape must he known and corrections made to account for perspective distortion or hole surface orientation. Not so with this algorithm. As a heuristic vision algorithm, this hole finder seeks edge patterns which correspond to holes -- any promising holes. The algorithm uses neighborhood operators applied in both horizontal and vertical strips to locate the hole centers. The power of the heuristic approach lies in the fact that these algorithms can be uninformed about the nature of the part itself. Yet, a robot can be directed to pick up the part using the hole to grasp it.

Citation Download Citation

R. Kelley and P. Gouin "Vision Algorithm For Finding Holes", Proc. SPIE 0521, Intelligent Robots and Computer Vision, (17 January 1985); https://doi.org/10.1117/12.946165

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available