Segmentation by watersheds: definition and parallel implementation
In the field of grey scale mathematical morphology the watershed transform, originally proposed by Digabel and Lantuéjoul, is frequently used for image segmentation [1, 9, 11]. It can be classified as a region-based segmentation approach. The intuitive idea underlying this method is that of flooding a landscape or topographic relief with water. Basins will fill up with water starting at local minima, and at points where water coming from different basins would meet, dams are built. When the water level has reached the highest peak in the landscape, the process is stopped. The set of dams thus obtained partitions the landscape into regions or ‘catchment basins’ separated by dams. These dams are called watershed lines or simply watersheds. A sketch is given in Fig. 1.
KeywordsShort Path Parallel Implementation Priority Queue Mathematical Morphology Level Component
Unable to display preview. Download preview PDF.
- Beucher, S., Meyer, F.: The morphological approach to segmentation: the watershed transformation. In: Dougherty E. R. (ed.): Mathematical Morphology in Image Processing. New York: Marcel Dekker 1993 (chapter 12, pp. 433–481 ).Google Scholar
- Meijster, A., Roerdink, J. B. T. M.: The implementation of a parallel watershed algorithm. In: van Vliet J.C. (ed.): Proc. Computing Science in the Netherlands, 27–28 November, Utrecht. Amsterdam: Stichting Mathematisch Centrum 1995 (pp. 134–142 ).Google Scholar
- Meijster, A., Roerdink, J. B. T. M.: A proposal for the implementation of a parallel watershed algorithm. In: Hlavac V., Sara R. (eds.): Computer Analysis of Images and Patterns. New York Heidelberg Berlin: Springer-Verlag 1995 (Lecture Notes in Computer Science, vol. 970, pp. 790–795 ).Google Scholar
- Meijster, A., Roerdink, J. B. T. M.: Computation of watersheds based on parallel graph algorithms. In: Maragos P., Shafer R. W., Butt M. A. (eds.): Mathematical Morphology and its Applications to Image and Signal Processing. Dordrecht: Kluwer Acad. Publ. 1996 (pp. 305–312 ).Google Scholar
- Vincent, L.: Algorithmes Morphologiques a Base de Files d’Attente et de Lacets. Extension aux Graphes. PhD thesis. Fontainebleau: Ecole Nationale Supérieure des Mines de Paris 1990.Google Scholar