Fusion graphs, region merging and watersheds

Authors:
Jean Cousty;Gilles Bertrand;Michel Couprie;Laurent Najman
Affiliations:
Laboratoire A2SI, Groupe ESIEE, Institut Gaspard-Monge, Noisy-le-Grand, France;Laboratoire A2SI, Groupe ESIEE, Institut Gaspard-Monge, Noisy-le-Grand, France;Laboratoire A2SI, Groupe ESIEE, Institut Gaspard-Monge, Noisy-le-Grand, France;Laboratoire A2SI, Groupe ESIEE, Institut Gaspard-Monge, Noisy-le-Grand, France
Venue:
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Year:
2006

Citing 6
Cited 2

Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Picture Processing

Digital Picture Processing
On Topological Watersheds

Journal of Mathematical Imaging and Vision
Quasi-Linear Algorithms for the Topological Watershed

Journal of Mathematical Imaging and Vision
Watersheds, mosaics, and the emergence paradigm

Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Grayscale watersheds on perfect fusion graphs

IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis

Fusion Graphs: Merging Properties and Watersheds

Journal of Mathematical Imaging and Vision
Weighted fusion graphs: Merging properties and watersheds

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions We consider a segmentation as a set of connected regions, separated by a frontier If the frontier set cannot be reduced without merging some regions then we call it a watershed In a general graph framework, merging two regions is not straightforward We define four classes of graphs for which we prove that some of the difficulties for defining merging procedures are avoided Our main result is that one of these classes is the class of graphs in which any watershed is thin None of the usual adjacency relations on ℤ2 and ℤ3 allows a satisfying definition of merging We introduce the perfect fusion grid on ℤn, a regular graph in which merging two neighboring regions can always be performed by removing from the frontier set all the points adjacent to both regions.