Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Computational approach for edge linking

Computational approach for edge linking 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 SPIE and IS&T. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Electronic Imaging SPIE

Computational approach for edge linking

Journal of Electronic Imaging , Volume 11 (4) – Oct 1, 2002

Loading next page...
 
/lp/spie/computational-approach-for-edge-linking-ReJaUZe048

References (26)

Publisher
SPIE
Copyright
Copyright © 2002 SPIE and IS&T
ISSN
1017-9909
eISSN
1560-229X
DOI
10.1117/1.1501574
Publisher site
See Article on Publisher Site

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. © 2002 SPIE and IS&T.

Journal

Journal of Electronic ImagingSPIE

Published: Oct 1, 2002

There are no references for this article.