Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
A new characterization of three-dimensional simple points
Pattern Recognition Letters
The Boundary Count of Digital Pictures
Journal of the ACM (JACM)
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)
Fusion graphs, region merging and watersheds
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Grayscale watersheds on perfect fusion graphs
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
A 3D fully parallel surface-thinning algorithm
Theoretical Computer Science
Weighted fusion graphs: Merging properties and watersheds
Discrete Applied Mathematics
Uniqueness of the Perfect Fusion Grid on Zd
Journal of Mathematical Imaging and Vision
ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
Collapses and Watersheds in Pseudomanifolds
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
On the Equivalence Between Hierarchical Segmentations and Ultrametric Watersheds
Journal of Mathematical Imaging and Vision
Hi-index | 0.00 |
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, 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 cleft, or binary watershed. In a general graph framework, merging two regions is not straightforward. We define four classes of graphs for which we prove, thanks to the notion of cleft, 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 cleft 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.