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. (C) 2002 SPIE and IST.