Title :
A disjoint set algorithm for the watershed transform
Author :
Meijster, Arnold ; Roerdink, Jos B. T. M.
Author_Institution :
Inst. for Math. & Comput. Sci., Univ. of Groningen, Groningen, Netherlands
Abstract :
In this paper the implementation of a watershed transform based on Tarjan´s Union-Find algorithm is described. The algorithm computes the watershed as defined by Meyer in [4]. The algorithm consists of two stages. In the first stage the image to be segmented is transformed into a lower complete image, using a FIFO-queue algorithm. In the second stage, the watershed of the lower complete image is computed. In this stage no FIFO-queues are used. This feature makes parallel implementation of the watershed transform much easier.
Keywords :
image segmentation; queueing theory; FIFO-queue algorithm; Tarjan union-find algorithm; disjoint set algorithm; image segmentation; parallel implementation; watershed transform; Arrays; Computers; Image segmentation; Morphology; Signal processing algorithms; Transforms; Vegetation;
Conference_Titel :
Signal Processing Conference (EUSIPCO 1998), 9th European
Conference_Location :
Rhodes
Print_ISBN :
978-960-7620-06-4
