17 January 1985 Vision Algorithm For Finding Holes
Author Affiliations +
Proceedings Volume 0521, Intelligent Robots and Computer Vision; (1985) https://doi.org/10.1117/12.946165
Event: 1984 Cambridge Symposium, 1984, Cambridge, United States
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.
© (1985) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
R. Kelley, P. Gouin, "Vision Algorithm For Finding Holes", Proc. SPIE 0521, Intelligent Robots and Computer Vision, (17 January 1985); doi: 10.1117/12.946165; https://doi.org/10.1117/12.946165


Edge Linking by Ellipsoidal Clustering
Proceedings of SPIE (March 01 1990)
Safely adapting a hierarchical reactive system
Proceedings of SPIE (August 06 1993)
High-speed low-latency portable visual-sensing system
Proceedings of SPIE (August 20 1993)
Fundamental principles of robot vision
Proceedings of SPIE (August 06 1993)

Back to Top