Sciweavers

2 search results - page 1 / 1
» Incremental Algorithm for Hierarchical Minimum Spanning Fore...
Sort
View
ISMM
2011
Springer
12 years 7 months ago
Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
We study hierarchical segmentations that are optimal in the sense of minimal spanning forests of the original image. We introduce a region-merging operation called uprooting, and w...
Jean Cousty, Laurent Najman
PAMI
2010
188views more  PAMI 2010»
12 years 11 months ago
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...