Sciweavers

27 search results - page 1 / 6
» On Watershed Cuts and Thinnings
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...
DGCI
2008
Springer
13 years 6 months ago
On Watershed Cuts and Thinnings
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
JMIV
2007
92views more  JMIV 2007»
13 years 4 months ago
Uniquely-Determined Thinning of the Tie-Zone Watershed Based on Label Frequency
There are many watershed transform algorithms in literature but most of them do not exactly correspond to their respective definition. The solution given by such algorithms depend...
Romaric Audigier, Roberto de Alencar Lotufo
ICIP
2008
IEEE
13 years 10 months ago
Raising in watershed lattices
The watershed segmentation is a popular tool in image processing. Starting from an initial map, the border thinning transformation produces a map whose minima constitute the catch...
Jean Cousty, Laurent Najman, Jean Serra
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...