Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method

DOI10.1515/mathm-2017-0004zbMath1469.68158OpenAlexW2794415434MaRDI QIDQ1980880

Yukiko Kenmochi, Jean Cousty, Zenilton jun. Patrocinio, Laurent Najman, Sílvio J. F. Guimarães

Publication date: 9 September 2021

Published in: Mathematical Morphology. Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/mathm-2017-0004

zbMATH Keywords

minimum spanning treehierarchical image segmentationgraph-based methodquasi-flat zone hierarchyscale-set theory

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Related Items (4)

Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps ⋮ Erratum to: ``Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method ⋮ An algebraic framework for out-of-core hierarchical segmentation algorithms ⋮ A Study of Observation Scales Based on Felzenswalb-Huttenlocher Dissimilarity Measure for Hierarchical Segmentation

Cites Work

• Unnamed Item
• Unnamed Item
• Global-local optimizations by hierarchical cuts and climbing energies
• Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps
• Mathematical morphology and its applications to image processing
• On the equivalence between hierarchical segmentations and ultrametric watersheds
• Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks
• A lattice approach to image segmentation
• Pyramid segmentation algorithms revisited
• Scale-sets image analysis
• Efficient graph-based image segmentation
• A Contrario Selection of Optimal Partitions for Image Segmentation
• Evaluation of Morphological Hierarchies for Supervised Segmentation
• New Characterizations of Minimum Spanning Trees and of Saliency Maps Based on Quasi-flat Zones
• Efficiency of a Good But Not Linear Set Union Algorithm
• The hierarchy of the cocoons of a graph and its application to image segmentation
• Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs
• Structural, Syntactic, and Statistical Pattern Recognition
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method