Many approaches have been adopted to solve the problem of image segmentation. Among them a noticeable part is based on graph theory casting the pixels as nodes in a graph. This paper proposes an algorithm to select clusters in the images (corresponding to relevant segments in the image) corresponding to the areas induced in the images through the search of the Minimum Spanning Tree (MST). In particular it is based on a clustering algorithm that extracts clusters computing a hierarchy of Minimum Spanning Trees. The main drawback of this previous algorithm is that the dimension of the cluster is not predictable and a relevant portion of found clusters can be composed by micro-clusters that are useless in the segments computation. A new algorithm and a new metric are proposed to select the exact number of clusters and avoid unmeaningful clusters.
Infantino, I., Gaglio, S., Vella, F., Vetrano, G. (2012). Image Segmentation through a Hierarchy of Minimum Spanning Trees. In Eighth International Conference on Signal Image Technology and Internet Based Systems (SITIS) (pp.381-388) [10.1109/SITIS.2012.62].
Image Segmentation through a Hierarchy of Minimum Spanning Trees
GAGLIO, Salvatore;
2012-01-01
Abstract
Many approaches have been adopted to solve the problem of image segmentation. Among them a noticeable part is based on graph theory casting the pixels as nodes in a graph. This paper proposes an algorithm to select clusters in the images (corresponding to relevant segments in the image) corresponding to the areas induced in the images through the search of the Minimum Spanning Tree (MST). In particular it is based on a clustering algorithm that extracts clusters computing a hierarchy of Minimum Spanning Trees. The main drawback of this previous algorithm is that the dimension of the cluster is not predictable and a relevant portion of found clusters can be composed by micro-clusters that are useless in the segments computation. A new algorithm and a new metric are proposed to select the exact number of clusters and avoid unmeaningful clusters.File | Dimensione | Formato | |
---|---|---|---|
Image Segmentation through a Hierarchy of Minimum Spanning Trees - articolo principale.pdf
Solo gestori archvio
Descrizione: articolo principale
Dimensione
380.19 kB
Formato
Adobe PDF
|
380.19 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Image Segmentation through a Hierarchy of Minimum Spanning Trees - copertina.pdf
Solo gestori archvio
Descrizione: copertina
Dimensione
970.53 kB
Formato
Adobe PDF
|
970.53 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Image Segmentation through a Hierarchy of Minimum Spanning Trees - indice.pdf
Solo gestori archvio
Descrizione: indice
Dimensione
199.21 kB
Formato
Adobe PDF
|
199.21 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.