The Waterfall Hierarchy on Weighted Graphs

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. 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
Springer. ISMM 2015, May 2015, Reykjavic, Iceland. Mathematical Morphology and Its Applications to Signal and Image Processing, 2015, 〈10.1007/978-3-319-18720-4_28〉
Liste complète des métadonnées

https://hal-mines-paristech.archives-ouvertes.fr/hal-01255435
Contributeur : Fernand Meyer <>
Soumis le : mercredi 13 janvier 2016 - 16:13:44
Dernière modification le : vendredi 27 octobre 2017 - 17:36:02

Identifiants

Collections

Citation

Fernand Meyer. The Waterfall Hierarchy on Weighted Graphs. Springer. ISMM 2015, May 2015, Reykjavic, Iceland. Mathematical Morphology and Its Applications to Signal and Image Processing, 2015, 〈10.1007/978-3-319-18720-4_28〉. 〈hal-01255435〉

Partager

Métriques

Consultations de la notice

68