The waterfall hierarchy on weighted graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année :

The waterfall hierarchy on weighted graphs

Résumé

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.
Fichier principal
Vignette du fichier
ismm2015wfv2.pdf (1.99 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01111747 , version 1 (30-01-2015)

Licence

Paternité - CC BY 4.0

Identifiants

Citer

Fernand Meyer. The waterfall hierarchy on weighted graphs. International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing, 2015, Reykjavik, Iceland. ⟨10.1007/978-3-319-18720-4_28⟩. ⟨hal-01111747⟩
216 Consultations
240 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More