In this paper, a comparative assessment of the Image Divide andLink Algorithm (ID&L) in different color spaces is presented. This, inorder to show the signicance of choosing a specic color space whenthe algorithm computes the dissimilarity measure between adjacentpixels. Specically, the algorithm procedure is based on treating a dig-ital image as a graph, assigning a weight to each edge based on thedissimilarity measure between adjacent pixels. Then, the algorithmconstructs a spanning forest through a Kruskal scheme to order theedges successively while partitions are obtained. This process is drivenuntil all the pixels of the image are segmented, that is, there are asmany regions as pixels. The results of the algorithm have been com-pared with those generated using dierent color spaces are shown.
@article{615,
title = {Comparative assessment of the Image Divide and Link Algorithm in different color spaces},
journal = {Tatra Mountains Mathematical Publications},
volume = {72},
year = {2019},
doi = {10.2478/tmmp-2018-0019},
language = {EN},
url = {http://dml.mathdoc.fr/item/615}
}
Guada, Carely; Gómez, Daniel; Rodríguez, J. Tinguaro; Montero, Javier. Comparative assessment of the Image Divide and Link Algorithm in different color spaces. Tatra Mountains Mathematical Publications, Tome 72 (2019) . doi : 10.2478/tmmp-2018-0019. http://gdmltest.u-ga.fr/item/615/