Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs

DOI10.1007/978-3-642-38294-9_8zbMath1382.68291MaRDI QIDQ4925098

Laurent Najman, Benjamin Perret, Jean Cousty

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_8

Mathematics Subject Classification ID

68U10: Computing methodologies for image processing

68R10: Graph theory (including graph drawing) in computer science

Related Items

Recognizing Hierarchical Watersheds, MSO: a framework for bound-constrained black-box global optimization algorithms, Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps, An automatic cognitive graph-based segmentation for detection of blood vessels in retinal images, Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method, Watershed-based attribute profiles for pixel classification of remote sensing data, An algebraic framework for out-of-core hierarchical segmentation algorithms, Characterization of graph-based hierarchical watersheds: theory and algorithms, Inf-structuring functions: a unifying theory of connections and connected operators, Evaluation of Morphological Hierarchies for Supervised Segmentation, New Characterizations of Minimum Spanning Trees and of Saliency Maps Based on Quasi-flat Zones