On Watershed Cuts and Thinnings

DOI10.1007/978-3-540-79126-3_39MaRDI QIDQ5458911zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(6)

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

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)