Sciweavers

2 search results - page 1 / 1
» Watershed Cuts: Thinnings, Shortest Path Forests, and Topolo...
Sort
View
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...
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
14 years 9 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...