Morphology on graphs and minimum spanning trees

Abstract : This paper revisits the construction of watershed and waterfall hierarchies through a thorough analysis of Boruvka's algorithms for constructing minimum spanning trees of edge weighted graphs. In the case where the watershed of a node weighted graph is to be constructed, we propose a distribution of weights on the edges, so that the waterfall extraction on the edge weighted graph becomes equivalent with the watershed extraction on the node weighted graph.
Type de document :
Communication dans un congrès
Michael H. F. Wilkinson and Jos B. T. M. Roerdink. 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM 2009, Aug 2009, Groningen, Netherlands. Springer, 5720, pp.161-170, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-03613-2_15〉
Liste complète des métadonnées

https://hal-mines-paristech.archives-ouvertes.fr/hal-00834386
Contributeur : Bibliothèque Mines Paristech <>
Soumis le : vendredi 14 juin 2013 - 18:05:06
Dernière modification le : vendredi 27 octobre 2017 - 17:36:02

Identifiants

Collections

Citation

Fernand Meyer, Jean Stawiaski. Morphology on graphs and minimum spanning trees. Michael H. F. Wilkinson and Jos B. T. M. Roerdink. 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM 2009, Aug 2009, Groningen, Netherlands. Springer, 5720, pp.161-170, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-03613-2_15〉. 〈hal-00834386〉

Partager

Métriques

Consultations de la notice

125