An algebraic framework for out-of-core hierarchical segmentation algorithms

DOI10.1007/978-3-030-76657-3_27zbMath1484.68293OpenAlexW3162066853MaRDI QIDQ2061825

Pierre Kamlay, Stela Carneiro, Harold Phelippeau, Lilian Buzer, Benjamin Perret, Jean Cousty

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-76657-3_27

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10) Data structures (68P05)

Related Items (1)

Morphological hierarchies: a unifying framework with new trees

Cites Work

• Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps
• Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method
• Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks
• Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs
• Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs
• Connected Morphological Attribute Filters on Distributed Memory Parallel Machines
• Ultrametric fitting by gradient descent ^*

This page was built for publication: An algebraic framework for out-of-core hierarchical segmentation algorithms