Research indexJournal article
Ant based edge linking algorithm
Jevtić, Melgar, Andina
1 Nov 2009
NobleIDark:/48914/w1/20260521/CE40D80EDOI10.1109/iecon.2009.5415195
Ant based edge linking algorithm
Jevtić, Melgar, Andina · 2009 · Subscription
NobleIDark:/48914/w1/20260521/CE40D80EDOI10.1109/iecon.2009.5415195
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
Conventional image edge detectors always result in missing parts of the edges. Broken edge linking is an image improvement technique that is complementary to edge detection, where the broken edges are connected to form closed contours in order to separate the regions in the image. In this paper, Ant System (AS) algorithm is modified for edge linking problem. As input, a binary image obtained after applying the Sobel edge operator is used. The proposed method defines a novel fitness function dependent on two variables: the grayscale visibility of the pixels and the length of the connecting edge, in order to obtain effective solution evaluation. Another novelty is of applying the grayscale visibility matrix as the initial pheromone trails matrix so that the pixels belonging to true edges have a higher probability of being chosen by ants on their initial routes, which reduces computational load. The results of the experiments are presented to confirm the effectiveness of the proposed method.