Paper
19 April 2004 Some properties of topological grayscale watersheds
Author Affiliations +
Proceedings Volume 5300, Vision Geometry XII; (2004) https://doi.org/10.1117/12.526740
Event: Electronic Imaging 2004, 2004, San Jose, California, United States
Abstract
In this paper, we investigate topological watersheds. For that purpose we introduce a notion of “separation between two points” of an image. One of our main results is a necessary and sufficient condition for a map G to be a watershed of a map F, this condition is based on the notion of separation. A consequence of the theorem is that there exists a (greedy) polynomial time algorithm to decide whether a map G is a watershed of a map F or not. We also show that, given an arbitrary total order on the minima of a map, it is possible to define a notion of “degree of separation of a minimum” relative to this order. This leads to another necessary and sufficient condition for a map G to be a watershed of a map F. At last we derive, from our framework, a new definition for the dynamics of a minimum.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gilles Bertrand "Some properties of topological grayscale watersheds", Proc. SPIE 5300, Vision Geometry XII, (19 April 2004); https://doi.org/10.1117/12.526740
Lens.org Logo
CITATIONS
Cited by 8 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithms

Electronic imaging

Vision geometry

Back to Top