A Disjoint Set Algorithm for the Watershed Transform


28 Citaten (Scopus)
163 Downloads (Pure)


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 previously. 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.
Originele taal-2English
TitelProc. IX European Signal Processing Conference (EUSIPCO '98), Rhodos, Greece
RedacteurenS Theodoridis, I Pitas, A Stouraitis, N Kalouptsidis
UitgeverijUniversity of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science
Pagina's1665 - 1668
Aantal pagina's10
StatusPublished - 1998

Citeer dit