Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs

Abstract : The goal of this paper is to provide linear or quasi-linear algorithms for producing some of the various trees used in mathematical morphology, in particular the trees corresponding to hierarchies of watershed cuts and hierarchies of constrained connectivity. A specific binary tree, corresponding to an ordered version of the edges of the minimum spanning tree, is the key structure in this study, and is computed thanks to variations around Kruskal algorithm for minimum spanning tree.
Type de document :
Communication dans un congrès
C.L. Luengo Hendriks, G. Borgefors, R. Strand. International Symposium on Mathematical Morphology, May 2013, Uppsala, Sweden. Springer, 7883, pp.135-146, 2013, Lecture Notes in Computer Science
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-00798621
Contributeur : Laurent Najman <>
Soumis le : samedi 9 mars 2013 - 11:18:58
Dernière modification le : vendredi 29 mars 2013 - 08:27:24
Document(s) archivé(s) le : dimanche 2 avril 2017 - 10:46:48

Fichier

ismm2013-algo.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00798621, version 1

Citation

Laurent Najman, Jean Cousty, Benjamin Perret. Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs. C.L. Luengo Hendriks, G. Borgefors, R. Strand. International Symposium on Mathematical Morphology, May 2013, Uppsala, Sweden. Springer, 7883, pp.135-146, 2013, Lecture Notes in Computer Science. 〈hal-00798621〉

Partager

Métriques

Consultations de
la notice

418

Téléchargements du document

1226