Component-Hypertrees for Image Segmentation

DOI10.1007/978-3-642-21569-8_25zbMath1339.68288OpenAlexW178077491MaRDI QIDQ3013057

Benoît Naegel, Nicolas Passat

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://hal.univ-reims.fr/hal-01695041/file/Passat_ISMM_2011.pdf

zbMATH Keywords

segmentationhypertreecomponent-treemask-based connectivity

Mathematics Subject Classification ID

Trees (05C05) Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Shape-Based Analysis on Component-Graphs for Multivalued Image Processing ⋮ Incremental and Efficient Computation of Families of Component Trees ⋮ Morphological hierarchies: a unifying framework with new trees ⋮ A topological tree of shapes ⋮ Shape-based analysis on component-graphs for multivalued image processing ⋮ Minimal Component-Hypertrees ⋮ Component-graph construction

This page was built for publication: Component-Hypertrees for Image Segmentation