Playing with Kruskal: algorithms for flat and hierarchical watershed cuts

Jean Cousty, Laurent Najman, Benjamin Perret +1

In the framework of edge-weighted graphs, watersheds have proven to be linked to well-known optimization problems, as Minimum Spanning Tree, which allowed the design of efficient a…