Edge linking by sequential search

Aly A. Farag; Edward J. Delp

doi:10.1117/12.57131

1 February 1992 Edge linking by sequential search

Aly A. Farag, Edward J. Delp

Proceedings Volume 1609, Model-Based Vision Development and Tools; (1992) https://doi.org/10.1117/12.57131
Event: Robotics '91, 1991, Boston, MA, United States

Abstract

Edge detection is a two-stage process: edge enhancement followed by edge linking. In this paper we develop a linking algorithm for the combination of edge elements enhanced by an optimal filter. The linking algorithm is based on sequential search. From a starting node, transitions are made to the goal nodes based on a maximum likelihood metric. Results of our search algorithm are compared to the nonmaximal suppression approach, as well as to the sequential edge linking algorithm. It is shown that the metric described here is very easy to implement and provides more accurate results.

Citation Download Citation

Aly A. Farag and Edward J. Delp "Edge linking by sequential search", Proc. SPIE 1609, Model-Based Vision Development and Tools, (1 February 1992); https://doi.org/10.1117/12.57131

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