New Characterizations of Minimum Spanning Trees and of Saliency Maps Based on Quasi-flat Zones

DOI10.1007/978-3-319-18720-4_18zbMath1445.68286arXiv1505.07203OpenAlexW3106487739MaRDI QIDQ2946804

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

Publication date: 18 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.07203

zbMATH Keywords

minimum spanning treehierarchysaliency map

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

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 ⋮ Evaluation of Combinations of Watershed Hierarchies ⋮ Quasi-Flat Zones for Angular Data Simplification

Cites Work

• Global-local optimizations by hierarchical cuts and climbing energies
• On the equivalence between hierarchical segmentations and ultrametric watersheds
• Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks
• Scale-sets image analysis
• Quasi-linear algorithms for the topological watershed
• Efficient graph-based image segmentation
• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs
• Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New Characterizations of Minimum Spanning Trees and of Saliency Maps Based on Quasi-flat Zones