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

DOI10.1007/978-3-319-18720-4_18MaRDI QIDQ2946804zbMATH OpenOpenAlexFDO

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)

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

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)

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.

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

Cites work

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

Cited in

(6)

• Quasi-flat zones for angular data simplification
• 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
• A tree partition algorithm for analysis of morpholocial structure of material
• 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)