Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs

DOI10.1007/978-3-642-38294-9_12zbMath1382.68179OpenAlexW1875942627MaRDI QIDQ4925102

Benjamin Perret, Jean Cousty, Laurent Najman

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38294-9_12

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (15)

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 ⋮ GraphBPT: An Efficient Hierarchical Data Structure for Image Representation and Probabilistic Inference ⋮ 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 ⋮ Some open questions on morphological operators and representations in the deep learning era. A personal vision ⋮ An algebraic framework for out-of-core hierarchical segmentation algorithms ⋮ Fuzzy-marker-based segmentation using hierarchies ⋮ Recognizing Hierarchical Watersheds ⋮ Ultrametric fitting by gradient descent ^* ⋮ Morphological Semigroups and Scale-Spaces on Ultrametric Spaces ⋮ Prior-Based Hierarchical Segmentation Highlighting Structures of Interest ⋮ Inf-structuring functions: a unifying theory of connections and connected operators

This page was built for publication: Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs