Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Watershed of a continuous function
Signal Processing - Special issue on mathematical morphology and its applications to signal processing
Topographic distance and watershed lines
Signal Processing - Special issue on mathematical morphology and its applications to signal processing
Geodesic Saliency of Watershed Contours and Hierarchical Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
The watershed transform: definitions, algorithms and parallelization strategies
Fundamenta Informaticae - Special issue on mathematical morphology
Order independent homotopic thinning for binary and grey tone anchored skeletons
Pattern Recognition Letters
IFT-Watershed from Gray-Scale Marker
SIBGRAPI '02 Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing
Quasi-Linear Algorithms for the Topological Watershed
Journal of Mathematical Imaging and Vision
The fuzzy geometry of image subsets
Pattern Recognition Letters
A neutrosophic approach to image segmentation based on watershed method
Signal Processing
Automated, accurate and fast segmentation of 4D cardiac MR images
FIMH'07 Proceedings of the 4th international conference on Functional imaging and modeling of the heart
Segmentation of 4D cardiac MRI: Automated method based on spatio-temporal watershed cuts
Image and Vision Computing
On the Equivalence Between Hierarchical Segmentations and Ultrametric Watersheds
Journal of Mathematical Imaging and Vision
Towards a parallel topological watershed: first results
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
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
Hi-index | 0.00 |
In this paper, we investigate the links between the flooding paradigm and the topological watershed. Guided by the analysis of a classical flooding algorithm, we present several notions that lead us to a better understanding of the watershed: minima extension, mosaic, pass value and separation. We first make a detailed examination of the effectiveness of the divide set produced by watershed algorithms. We introduce the mosaic to retrieve the altitude of points along the divide set. A desirable property is that, when two minima are separated by a crest in the original image, they are still separated by a crest of the same altitude in the mosaic. Our main result states that this is the case if and only if the mosaic is obtained through a topological thinning. We investigate the possibility for a flooding to produce a topological watershed, and conclude that this is not feasible. This leads us to reverse the flooding paradigm, and to propose a notion of emergence. An emergence process is a transformation based on a topological criterion, in which points are processed in decreasing altitude order while preserving the number of connected components of lower cross-sections. Our main result states that any emergence watershed is a topological watershed, and more remarkably, that any topological watershed of a given image can be obtained as an emergence watershed of the image.