Semi-connections and hierarchies

Abstract : Connectivity is the basis of several methodological concepts in mathematical morphology. In graph-based approaches, the notion of connectivity can be derived from the notion of adjacency. In this preliminary work, we investigate the effects of relaxing the symmetry property of adjacency. In particular, we observe the consequences on the induced connected components, that are no longer organised as partitions but as covers, and on the hierarchies that are obtained from such components. These hierarchies can extend data structures such as component-trees and partition-trees, and the associated filtering and segmentation paradigms, leading to improved image processing tools.
Type de document :
Communication dans un congrès
International Symposium on Mathematical Morphology (ISMM), 2013, Uppsala, Sweden. Springer, 7883, pp.157-168, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-38294-9_14〉
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

https://hal.univ-reims.fr/hal-01719130
Contributeur : Nicolas Passat <>
Soumis le : mercredi 28 février 2018 - 02:18:42
Dernière modification le : jeudi 19 juillet 2018 - 15:34:01
Document(s) archivé(s) le : lundi 28 mai 2018 - 18:23:53

Fichier

article_Revision.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Olena Tankyevych, Hugues Talbot, Nicolas Passat. Semi-connections and hierarchies. International Symposium on Mathematical Morphology (ISMM), 2013, Uppsala, Sweden. Springer, 7883, pp.157-168, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-38294-9_14〉. 〈hal-01719130〉

Partager

Métriques

Consultations de la notice

81

Téléchargements de fichiers

31