Sciweavers

2498 search results - page 1 / 500
» Algorithms for the Topological Watershed
Sort
View
DGCI
2005
Springer
13 years 10 months ago
Algorithms for the Topological Watershed
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
Michel Couprie, Laurent Najman, Gilles Bertrand
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 5 months ago
Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
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...
ISMM
2011
Springer
12 years 7 months ago
Towards a Parallel Topological Watershed: First Results
Abstract. In this paper we present a parallel algorithm for the topological watershed, suitable for a shared memory parallel architecture. On a 24-core machine an average speed-up ...
Joël van Neerbos, Laurent Najman, Michael H. ...
DGCI
2003
Springer
13 years 10 months ago
Watershed Algorithms and Contrast Preservation
This paper is devoted to the study of watershed algorithms
Laurent Najman, Michel Couprie