Weighted fusion graphs: Merging properties and watersheds

DOI10.1016/j.dam.2008.01.005zbMath1180.05117OpenAlexW2091578155MaRDI QIDQ1005244

Jean Cousty, Michel Couprie, Gilles Bertrand, Laurent Najman

Publication date: 9 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.005

zbMATH Keywords

image processingweighted graphsimage segmentationvertex weighted graphsbinary watershedC-watershedcleftfusion graphsmorphological region mergingperfect fusion graphsregion merging methods

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (8)

Ultrametric Watersheds ⋮ On the equivalence between hierarchical segmentations and ultrametric watersheds ⋮ A 3D fully parallel surface-thinning algorithm ⋮ Uniqueness of the perfect fusion grid on \(\mathbb{Z}^d\) ⋮ Collapses and watersheds in pseudomanifolds of arbitrary dimension ⋮ A tutorial on well-composedness ⋮ Weighted fusion graphs: Merging properties and watersheds ⋮ Fusion graphs: merging properties and watersheds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted fusion graphs: Merging properties and watersheds
• Watersheds, mosaics, and the emergence paradigm
• On topological watersheds
• Quasi-linear algorithms for the topological watershed
• Faster algorithms for the shortest path problem
• On RAM Priority Queues
• Fusion Graphs, Region Merging and Watersheds
• On Watershed Cuts and Thinnings

This page was built for publication: Weighted fusion graphs: Merging properties and watersheds