New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones

DOI10.1007/978-3-319-18720-4_18zbMATH Open1445.68286arXiv1505.07203OpenAlexW3106487739MaRDI QIDQ2946804FDOQ2946804

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

Publication date: 18 September 2015

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

Abstract: We study three representations of hierarchies of partitions: dendrograms (direct representations), saliency maps, and minimum spanning trees. We provide a new bijection between saliency maps and hierarchies based on quasi-flat zones as used in image processing and characterize saliency maps and minimum spanning trees as solutions to constrained minimization problems where the constraint is quasi-flat zones preservation. In practice, these results form a toolkit for new hierarchical methods where one can choose the most convenient representation. They also invite us to process non-image data with morphological hierarchies.

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

Recommendations

• Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps
• scientific article; zbMATH DE number 5904848
• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• Morphology on Graphs and Minimum Spanning Trees
• Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs

zbMATH Keywords

hierarchyminimum spanning treesaliency map

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Ordering partial partitions for image segmentation and filtering: merging, creating and inflating blocks
• Efficient graph-based image segmentation
• Title not available (Why is that?)
• Constructive links between some morphological hierarchies on edge-weighted graphs
• On the equivalence between hierarchical segmentations and ultrametric watersheds
• Scale-sets image analysis
• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• Global-local optimizations by hierarchical cuts and climbing energies
• Quasi-linear algorithms for the topological watershed
• Title not available (Why is that?)
• Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs

Cited In (6)

• Quasi-flat zones for angular data simplification
• Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps
• A tree partition algorithm for analysis of morpholocial structure of material
• Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method
• A depth assignment method for two-dimensional map based on minimum spanning tree
• Evaluation of combinations of watershed hierarchies

This page was built for publication: New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946804)