The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle
Open accessAbstract
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 basins" (through a steepest descent property) or by the "dividing lines" separating these catchment basins (through the drop of water principle). Then, we prove, through an equivalence theorem, their optimality in terms of minimum spanning forests. Afterward, we introduce a linear-time algorithm to compute them. To the best of our knowledge, similar properties are not verified in other frameworks and the proposed algorithm is the most efficient existing algorithm, both in theory and in practice. Finally, the defined concepts are illustrated in image segmentation, leading to the conclusion that the proposed approach improves, on the tested images, the quality of watershed-based segmentations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Image analysis and mathematical morphology
(1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90078-8 · Cited by 8,151
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Watersheds in digital spaces: an efficient algorithm based on immersion simulations
Vincent, L., & Soille, P. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.87344 · Cited by 5,649
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Diestel, R. (1997) · Cited by 5,082
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Introduction to Algorithms, Second Edition
Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984
Soille, P. (1999) · Springer eBooks · doi:10.1007/978-3-662-03939-7 · Cited by 1,977
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
Topographic distance and watershed lines
Meyer, F. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90060-4 · Cited by 1,403
The Watershed Transform: Definitions, Algorithms and Parallelization Strategies
Roerdink, J. B. T. M., & Meijster, A. (2000) · Fundamenta Informaticae · doi:10.3233/fi-2000-411207 · Cited by 1,372
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.2307/2033241 · Cited by 1,117
Use of watersheds in contour detection
Beucher, S. (1979) · Medical Entomology and Zoology · Cited by 1,100
Using Canny's criteria to derive a recursively implemented optimal edge detector
Deriche, R. (1987) · International Journal of Computer Vision · doi:10.1007/bf00123164 · Cited by 1,089
Digital topology: Introduction and survey
Kong, T. Y., & Rosenfeld, A. (1989) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(89)90147-3 · Cited by 1,010
The Morphological Approach to Segmentation: The Watershed Transformation
Beucher, S., & Meyer, F. (2018) · Mathematical Morphology in Image Processing · doi:10.1201/9781482277234-12 · Cited by 881
Udupa, J. K., & Samarasekera, S. (1996) · Graphical Models and Image Processing · doi:10.1006/gmip.1996.0021 · Cited by 839
On the History of the Minimum Spanning Tree Problem
Graham, R. L., & Hell, P. (1985) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1985.10011 · Cited by 813
The image foresting transform: theory, algorithms, and applications
Falcao, A. X., Stolfi, J., & de Alencar Lotufo, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1261076 · Cited by 614
Geodesic saliency of watershed contours and hierarchical segmentation
Najman, L., & Schmitt, M. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.546254 · Cited by 498
Self-citationAttribute Openings, Thinnings, and Granulometries
Breen, E. J., & Jones, R. H. (1996) · Computer Vision and Image Understanding · doi:10.1006/cviu.1996.0066 · Cited by 433
Watershed, Hierarchical Segmentation and Waterfall Algorithm
Beucher, S. (1994) · Computational Imaging and Vision · doi:10.1007/978-94-011-1040-2_10 · Cited by 351
Image analysis and mathematical morphology
O'Connor, C. (1987) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(87)90243-4 · Cited by 351
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Chazelle, B. (2000) · Journal of the ACM · doi:10.1145/355541.355562 · Cited by 328
Watershed of a continuous function
Najman, L., & Schmitt, M. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90059-0 · Cited by 317
Self-citationNešetřil, J., Milková, E., & Nešetřilová, H. (2001) · Discrete Mathematics · doi:10.1016/s0012-365x(00)00224-7 · Cited by 307
Scale-Based Fuzzy Connected Image Segmentation: Theory, Algorithms, and Validation
Saha, P. K., Udupa, J. K., & Odhner, D. (2000) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0813 · Cited by 294
The complexity of multiway cuts (extended abstract)
Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., Seymour, P. D., & Yannakakis, M. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129736 · Cited by 221
L. On hills and dales: To the editors of the Philosophical Magazine and Journal
Maxwell, J. C. (1870) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786447008640422 · Cited by 188
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds
Cousty, J., Bertrand, G., Najman, L., & Couprie, M. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.71 · Cited by 184
Self-citationUdupa, J. K., Saha, P. K., & Lotufo, R. A. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1046162 · Cited by 158
Topological gray-scale watershed transformation
Couprie, M., & Bertrand, G. (1997) · Optics & Photonics · doi:10.1117/12.292778 · Cited by 131
Self-citationSome links between min cuts, optimal spanning forests and watersheds
Allène, C., Audibert, J.-Y., Couprie, M., Cousty, J., & Keriven, R. (2007) · HAL · Cited by 73
Self-citationVectorial scale-based fuzzy-connected image segmentation
Zhuge, Y., Udupa, J. K., & Saha, P. K. (2005) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2005.07.009 · Cited by 53
Cited by
Power Watershed: A Unifying Graph-Based Optimization Framework
Couprie, C., Grady, L., Najman, L., & Talbot, H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.200 · Cited by 305
Self-citationAutomatic breast ultrasound image segmentation: a survey
Xian, M., Zhang, Y., Cheng, H. D., Xu, F., Zhang, B., & Ding, J. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.02.012 · Cited by 284
“, in [120], a well-trained ANN was applied to perform the tumor segmentation.”
MethodMitoEM Dataset: Large-Scale 3D Mitochondria Instance Segmentation from EM Images
Wei, D., Lin, Z., Franco-Barranco, D., Wendt, N., Liu, X., Yin, W., Huang, X., Gupta, A., Jang, W.-D., Wang, X., et al. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-59722-1_7 · Cited by 105
Metadata
- Authors
- Cousty, J., Bertrand, G., Najman, L., & Couprie, M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2009-08
- Volume
- 31
- Issue
- 8
- Pages
- 1362-1374
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2128000934
- Cited by
- 352
- References
- 37
- FWCI
- 24.55
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.