Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle

@article{Cousty2009WatershedCM,
  title={Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle},
  author={Jean Cousty and Gilles Bertrand and Laurent Najman and Michel Couprie},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2009},
  volume={31},
  pages={1362-1374}
}
We study the watersheds in edge-weighted graphs. We define the watershed cuts following the intuitive idea of drops of water flowing on a topographic surface. We first establish the consistency of these watersheds: they can be equivalently defined by their "catchment basinsrdquo (through a steepest descent property) or by the "dividing linesrdquo separating these catchment basins (through the drop of water principle). Then, we prove, through an equivalence theorem, their optimality in terms of… CONTINUE READING
Highly Influential
This paper has highly influenced 25 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 321 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 145 extracted citations

Common parallelization strategy of topological operators on SMP machines

Advised, Mohamed Akil
2011
View 28 Excerpts
Method Support
Highly Influenced

Laplacian Coordinates for Seeded Image Segmentation

2014 IEEE Conference on Computer Vision and Pattern Recognition • 2014
View 10 Excerpts
Highly Influenced

322 Citations

02040'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 322 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 65 references

Iterative algorithms

H. Digabel, C. Lantuéjoul
Proc. 2nd European Symp. Quantitative Analysis of Microstructures i n Material Science, Biology and Medicine , 1978, pp. 85–89. • 1978
View 4 Excerpts
Highly Influenced

The image foresting transform: theory, algorithms, and applications

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2004
View 4 Excerpts
Highly Influenced

Un algorithme optimal de ligne de partage des e aux

F. Meyer
Procs. of 8ème Congrès AFCET , Lyon-Villeurbanne, France, 1991, pp. 847–859. • 1991
View 5 Excerpts
Highly Influenced

Using Canny's criteria to derive a recursively implemented optimal edge detector

International Journal of Computer Vision • 1987
View 4 Excerpts
Highly Influenced

Wate rsh d cuts: thinnings, topological watersheds and shortest path fores ts

J.Cousty, G. Bertrand, L. Najman, M. Couprie
2008, submitted. • 2008
View 3 Excerpts