<abstract xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, a comparative assessment of the Image Divide and Link Algorithm (ID&amp;L) in different color spaces is presented. This, in order to show the significance of choosing a specific color space when the algorithm computes the dissimilarity measure between adjacent pixels. Specifically, the algorithm procedure is based on treating a digital image as a graph, assigning a weight to each edge based on the dissimilarity measure between adjacent pixels. Then, the algorithm constructs a spanning forest through a Kruskal scheme to order the edges successively while partitions are obtained. This process is driven until all the pixels of the image are segmented, that is, there are as many regions as pixels. The results of the algorithm which have been compared with those generated using different color spaces are shown.</p></abstract>

In this paper, a comparative assessment of the Image Divide and Link Algorithm (ID&L) in different color spaces is presented. This, in order to show the significance of choosing a specific color space when the algorithm computes the dissimilarity measure between adjacent pixels. Specifically, the algorithm procedure is based on treating a digital image as a graph, assigning a weight to each edge based on the dissimilarity measure between adjacent pixels. Then, the algorithm constructs a spanning forest through a Kruskal scheme to order the edges successively while partitions are obtained. This process is driven until all the pixels of the image are segmented, that is, there are as many regions as pixels. The results of the algorithm which have been compared with those generated using different color spaces are shown.

Comparative Assessment of the Image Divide and Link Algorithm in Different Color Spaces

Tatra Mountains Mathematical Publications

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

In this paper, a comparative assessment of the Image Divide and Link Algorithm (ID&L) in different color spaces is presented. This, in order to show the...

Comparative Assessment of the Image Divide and Link Algorithm in Different Color Spaces

Publié en ligne: 12 mars 2019

Pages: 31 - 41

Reçu: 13 déc. 2017

DOI: https://doi.org/10.2478/tmmp-2018-0019

Mots clés
edge detection, color spaces, hierarchical partition, graph-based approach

© 2018 Carely Guada et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Comparative Assessment of the Image Divide and Link Algorithm in Different Color Spaces

Publié en ligne: 12 mars 2019

Pages: 31 - 41

Reçu: 13 déc. 2017

DOI: https://doi.org/10.2478/tmmp-2018-0019

Mots clésedge detection, color spaces, hierarchical partition, graph-based approach

© 2018 Carely Guada et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Mots clés
edge detection, color spaces, hierarchical partition, graph-based approach