The waterfall hierarchy on weighted graphs

Fernand Meyer (1)

1 CMM - Centre de Morphologie Mathématique

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.

Mots clés: 1 pass waterfall algorithm; edge and node weighted graphs; waterfall; watershed

Domaines: Informatique [cs]; Traitement des images [eess.IV]

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⟩