Recognizing Hierarchical Watersheds

DOI10.1007/978-3-030-14085-4_24OpenAlexW2905595484MaRDI QIDQ5237072

Laurent Najman, Deise Santana Maia, Benjamin Perret, Jean Cousty

Publication date: 16 October 2019

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

Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_24

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Characterization of graph-based hierarchical watersheds: theory and algorithms

Cites Work

• Unnamed Item
• Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps
• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• Evaluation of Hierarchical Watersheds
• Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs
• Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs
• Evaluation of Combinations of Watershed Hierarchies

This page was built for publication: Recognizing Hierarchical Watersheds