Playing with Kruskal: algorithms for flat and hierarchical watershed cuts
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 algorithms for computing (hierarchical) watershed segmentations. In the present article, after reviewing the literature related to watershed...
Jean Cousty, Laurent Najman, Benjamin Perret et al.
· HAL (Le Centre pour la Commu... · 0 citations