The waterfall hierarchy on weighted graphs

Fernand Meyer 1, *
Abstract : We study and present two new algorithms for constructing the waterfall hierarchy of a topographic surface. The first models a topographic surface as a flooding graph, each node representing a lake filling a catchment basin up to its lowest pass point ; each edge representing such a pass point. It It makes use of the equivalence of node and edge weighted graphs, passing from one type to the other during as the algorithm proceeds. The second algorithm produces the waterfall partition in one pass through the edges of a minimum spanning tree of the region adjacency graph associated to a topographic surface.
Type de document :
Communication dans un congrès
International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing, 2015, Reykjavik, Iceland. 9082, Lecture Notes in Computer Science. 〈10.1007/978-3-319-18720-4_28〉
Liste complète des métadonnées

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

https://hal-mines-paristech.archives-ouvertes.fr/hal-01111747
Contributeur : Fernand Meyer <>
Soumis le : vendredi 30 janvier 2015 - 20:45:16
Dernière modification le : vendredi 27 octobre 2017 - 17:36:02
Document(s) archivé(s) le : samedi 12 septembre 2015 - 07:16:09

Fichier

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

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Collections

Citation

Fernand Meyer. The waterfall hierarchy on weighted graphs. International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing, 2015, Reykjavik, Iceland. 9082, Lecture Notes in Computer Science. 〈10.1007/978-3-319-18720-4_28〉. 〈hal-01111747〉

Partager

Métriques

Consultations de la notice

134

Téléchargements de fichiers

140