On Watershed Cuts and Thinnings

DOI10.1007/978-3-540-79126-3_39zbMATH Open1138.68629OpenAlexW1550355854MaRDI QIDQ5458911FDOQ5458911

Authors: Jean Cousty, Gilles Bertrand, Laurent Najman, Michel Couprie 

Publication date: 24 April 2008

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79126-3_39

Recommendations

• Quasi-linear algorithms for the topological watershed
• Discrete region merging and watersheds
• Weighted fusion graphs: Merging properties and watersheds
• Morphology on Graphs and Minimum Spanning Trees
• Discrete Geometry for Computer Imagery

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Cites Work

• Introduction to algorithms
• On topological watersheds
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• An overview of morphological filtering
• On Watershed Cuts and Thinnings

Cited In (6)

• Weighted fusion graphs: Merging properties and watersheds
• Ultrametric Watersheds
• Some Morphological Operators in Graph Spaces
• On Watershed Cuts and Thinnings
• Morphology on Graphs and Minimum Spanning Trees
• Quasi-linear algorithms for the topological watershed

This page was built for publication: On Watershed Cuts and Thinnings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458911)