Computational approach for edge linking

Ovidiu Ghita; Paul F. Whelan

doi:10.1117/1.1501574

1 October 2002 Computational approach for edge linking

Ovidiu Ghita, Paul F. Whelan

Journal of Electronic Imaging, Vol. 11, Issue 4, (October 2002). https://doi.org/10.1117/1.1501574

Efficient edge operators such as those based on partial derivatives fail to return continuous edge maps. To address this, a supplementary edge linking step is required to complete initial edge information. In this paper we propose a fast and efficient algorithm for edge linking using local information around edge terminators. In order to minimize incorrect linking decisions, the direction and the linking path for each edge terminator are established by minimizing a cost function. The particular novelty of this approach lies in the labeling scheme which assigns the directionality of the edge terminators (endpoints) based only on local knowledge. As a consequence, it relaxes the demand of a priori knowledge and furthermore assures an accurate and efficient search for edge paths in the image.

©(2002) Society of Photo-Optical Instrumentation Engineers (SPIE)

Citation Download Citation

Ovidiu Ghita and Paul F. Whelan "Computational approach for edge linking," Journal of Electronic Imaging 11(4), (1 October 2002). https://doi.org/10.1117/1.1501574

Published: 1 October 2002

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