Sciweavers

Share
DGCI
2008
Springer

On Watershed Cuts and Thinnings

3 years 11 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 precisely, we introduce a new transformation, called border thinning, that lowers the values of edges that match a simple local configuration until idempotence and prove the equivalence between the cuts obtained by this transformation and the watershed cuts of a map. We discuss the possibility of parallel algorithms based on this transformation and give a sequential implementation that runs in linear time whatever the range of the input map.
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich
Added 19 Oct 2010
Updated 12 Jan 2011
Type Conference
Year 2008
Where DGCI
Authors Jean Cousty, Gilles Bertrand, Laurent Najman, Michel Couprie
Comments (0)
books