A Disjoint Set Algorithm for the Watershed Transform

Arnold Meijster; Jos B.T.M. Roerdink

A Disjoint Set Algorithm for the Watershed Transform

Arnold Meijster, Jos B.T.M. Roerdink

Onderzoeksoutput › Academic

28 Citaten (Scopus)

214 Downloads (Pure)

Samenvatting

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-2	English
Titel	Proc. IX European Signal Processing Conference (EUSIPCO '98), Rhodos, Greece
Redacteuren	S Theodoridis, I Pitas, A Stouraitis, N Kalouptsidis
Uitgeverij	University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science
Pagina's	1665 - 1668
Aantal pagina's	10
Status	Published - 1998

Toegang tot document

1998ProcEUSIPCOMeijster.pdfFinal publisher's version, 247 KB

Handle.net

Permanente koppeling

Citeer dit

@inbook{6990f857f6174d0c90231ee9498749b3,

title = "A Disjoint Set Algorithm for the Watershed Transform",

abstract = "In this paper the implementation of a watershed transform based on Tarjan{\textquoteright}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.",

author = "Arnold Meijster and Roerdink, {Jos B.T.M.}",

note = "Relation: http://www.rug.nl/informatica/organisatie/overorganisatie/iwi Rights: University of Groningen. Research Institute for Mathematics and Computing Science (IWI)",

year = "1998",

language = "English",

pages = "1665 -- 1668",

editor = "S Theodoridis and I Pitas and A Stouraitis and N Kalouptsidis",

booktitle = "Proc. IX European Signal Processing Conference (EUSIPCO '98), Rhodos, Greece",

publisher = "University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science",

}

A Disjoint Set Algorithm for the Watershed Transform. / Meijster, Arnold ; Roerdink, Jos B.T.M.
Proc. IX European Signal Processing Conference (EUSIPCO '98), Rhodos, Greece. uitgave / S Theodoridis; I Pitas; A Stouraitis; N Kalouptsidis. University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science, 1998. blz. 1665 - 1668.

Onderzoeksoutput › Academic

TY - CHAP

T1 - A Disjoint Set Algorithm for the Watershed Transform

AU - Meijster, Arnold

AU - Roerdink, Jos B.T.M.

N1 - Relation: http://www.rug.nl/informatica/organisatie/overorganisatie/iwi Rights: University of Groningen. Research Institute for Mathematics and Computing Science (IWI)

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

M3 - Chapter

SP - 1665

EP - 1668

BT - Proc. IX European Signal Processing Conference (EUSIPCO '98), Rhodos, Greece

A2 - Theodoridis, S

A2 - Pitas, I

A2 - Stouraitis, A

A2 - Kalouptsidis, N

PB - University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science

ER -

A Disjoint Set Algorithm for the Watershed Transform

Samenvatting

Toegang tot document

Handle.net

Vingerafdruk

Citeer dit