Share Email Print

Journal of Electronic Imaging

Computational approach for edge linking
Author(s): Ovidiu Ghita; Paul F. Whelan
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 1 October 2002
PDF: 7 pages
J. Electron. Imag. 11(4) doi: 10.1117/1.1501574
Published in: Journal of Electronic Imaging Volume 11, Issue 4
Show Author Affiliations
Ovidiu Ghita, Dublin City Univ. (Ireland)
Paul F. Whelan, Dublin City Univ. (Ireland)

© SPIE. Terms of Use
Back to Top