Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps

DOI10.1007/s10851-017-0768-7zbMath1420.94010OpenAlexW2621212586MaRDI QIDQ1635986

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

Publication date: 1 June 2018

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-017-0768-7

zbMATH Keywords

mathematical morphologyminimum spanning treeshierarchical classificationwatershedhierarchy of partitionshierarchical image segmentationsaliency maps

Mathematics Subject Classification ID

Applications of graph theory (05C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Applications of graph theory to circuits and networks (94C15)

Related Items

Some equivalence relation between persistent homology and morphological dynamics ⋮ Discrete Morse functions and watersheds ⋮ Characterization of graph-based hierarchical watersheds: theory and algorithms ⋮ Power spectral clustering ⋮ Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method ⋮ Prior-based hierarchical segmentation highlighting structures of interest ⋮ An algebraic framework for out-of-core hierarchical segmentation algorithms ⋮ A Study of Observation Scales Based on Felzenswalb-Huttenlocher Dissimilarity Measure for Hierarchical Segmentation ⋮ Recognizing Hierarchical Watersheds

Uses Software

• GrabCut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of hierarchical classification across different application domains
• Artwork 3D model database indexing and classification
• Global-local optimizations by hierarchical cuts and climbing energies
• On the equivalence between hierarchical segmentations and ultrametric watersheds
• 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
• Scale-sets image analysis
• On topological watersheds
• Efficient graph-based image segmentation
• New Characterizations of Minimum Spanning Trees and of Saliency Maps Based on Quasi-flat Zones
• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• Automatic Image Segmentation by Dynamic Region Merging
• Evaluation of Hierarchical Watersheds
• A Review of Hierarchical Classification
• Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs
• Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs
• Discrete Geometry for Computer Imagery