New cooperative edge linking

Patrick J. Bonnin; Bertrand Zavidovique

doi:10.1117/12.25144

1 February 1991 New cooperative edge linking

Patrick J. Bonnin, Bertrand Zavidovique

Proceedings Volume 1381, Intelligent Robots and Computer Vision IX: Algorithms and Techniques; (1991) https://doi.org/10.1117/12.25144
Event: Advances in Intelligent Robotics Systems, 1990, Boston, MA, United States

Abstract

This paper outlines a specific method of cooperative edge linking, where difference (edge points) and homogeneous (boundaries of regions) informations are simultaneously available. In only one scanning of the image, both classical steps of "edge closing (in a small distance)" and "edge linking" are gathered. Complete chains, corresponding to strong edges, are first extracted, knowing the local edge configuration around each edge point. Then, they are brocken, in order to find junction points. Such junctions are searched only at both ends of chains, on the edge image.

Citation Download Citation

Patrick J. Bonnin and Bertrand Zavidovique "New cooperative edge linking", Proc. SPIE 1381, Intelligent Robots and Computer Vision IX: Algorithms and Techniques, (1 February 1991); https://doi.org/10.1117/12.25144

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