Grayscale watersheds on perfect fusion graphs

Authors:
Jean Cousty;Michel Couprie;Laurent Najman;Gilles Bertrand
Affiliations:
Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE, Cité Descartes, Noisy-le-Grand, France;Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE, Cité Descartes, Noisy-le-Grand, France;Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE, Cité Descartes, Noisy-le-Grand, France;Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE, Cité Descartes, Noisy-le-Grand, France
Venue:
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Year:
2006

Citing 7
Cited 3

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

IEEE Transactions on Pattern Analysis and Machine Intelligence
Geodesic Saliency of Watershed Contours and Hierarchical Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
On RAM priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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)
Building the Component Tree in Quasi-Linear Time

IEEE Transactions on Image Processing

Fusion Graphs: Merging Properties and Watersheds

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

Discrete Applied Mathematics
Fusion graphs, region merging and watersheds

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study topological watersheds on perfect fusion graphs, an ideal framework for region merging. An important result is that contrarily to the general case, in this framework, any topological watershed is thin. Then we investigate a new image transformation called C-watershed and we show that, on perfect fusion graphs, the segmentations obtained by C-watershed correspond to segmentations obtained by topological watersheds. Compared to topological watershed, a major advantage of this transformation is that, on perfect fusion graph, it can be computed thanks to a simple linear-time immersion-like algorithm. Finally, we derive characterizations of perfect fusion graphs based on thinness properties of both topological watersheds and C-watersheds.