Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts

DOI10.1007/978-3-642-21569-8_24zbMath1279.94011OpenAlexW2180151948MaRDI QIDQ3013056

Jean Cousty, Laurent Najman

Publication date: 7 July 2011

Published in: Mathematical Morphology and Its Applications to Image and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21569-8_24

Mathematics Subject Classification ID

Trees (05C05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (12)

Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps ⋮ Evaluation of Morphological Hierarchies for Supervised Segmentation ⋮ New Characterizations of Minimum Spanning Trees and of Saliency Maps Based on Quasi-flat Zones ⋮ Component tree loss function: definition and optimization ⋮ Global-local optimizations by hierarchical cuts and climbing energies ⋮ Characterization of graph-based hierarchical watersheds: theory and algorithms ⋮ Prior-based hierarchical segmentation highlighting structures of interest ⋮ Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence ⋮ Fuzzy-marker-based segmentation using hierarchies ⋮ A Study of Observation Scales Based on Felzenswalb-Huttenlocher Dissimilarity Measure for Hierarchical Segmentation ⋮ Recognizing Hierarchical Watersheds ⋮ Evaluation of Combinations of Watershed Hierarchies

This page was built for publication: Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts