Difference between revisions of "Publications/geraud.05.ismm"
From LRDE
| Line 4: | Line 4: | ||
| authors = Thierry Géraud |
| authors = Thierry Géraud |
||
| title = Ruminations on Tarjan's Union-Find algorithm and connected operators |
| title = Ruminations on Tarjan's Union-Find algorithm and connected operators |
||
| + | | booktitle = Proceedings of the 7th International Symposium on Mathematical Morphology (ISMM'05) |
||
| − | | booktitle = ismm05 |
||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| volume = 30 |
| volume = 30 |
||
| ⚫ | |||
| ⚫ | |||
| abstract = This papers presents a comprehensive and general form of the Tarjan's union-find algorithm dedicated to connected operators. An interesting feature of this form is to introduce the notion of separated domains. The properties of this form and its flexibility are discussed and highlighted with examples. In particular, we give clues to handle correctly the constraint of domain-disjointness preservation and, as a consequence, we show how we can rely on “union-find” to obtain algorithms for self-dual filters approaches and levelings with a marker function. |
| abstract = This papers presents a comprehensive and general form of the Tarjan's union-find algorithm dedicated to connected operators. An interesting feature of this form is to introduce the notion of separated domains. The properties of this form and its flexibility are discussed and highlighted with examples. In particular, we give clues to handle correctly the constraint of domain-disjointness preservation and, as a consequence, we show how we can rely on “union-find” to obtain algorithms for self-dual filters approaches and levelings with a marker function. |
||
| ⚫ | |||
| lrdekeywords = Image |
| lrdekeywords = Image |
||
| lrdenewsdate = 2005-01-05 |
| lrdenewsdate = 2005-01-05 |
||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| type = inproceedings |
| type = inproceedings |
||
| id = geraud.05.ismm |
| id = geraud.05.ismm |
||
| Line 21: | Line 21: | ||
title = <nowiki>{</nowiki>Ruminations on <nowiki>{</nowiki>T<nowiki>}</nowiki>arjan's <nowiki>{</nowiki>U<nowiki>}</nowiki>nion-<nowiki>{</nowiki>F<nowiki>}</nowiki>ind algorithm and |
title = <nowiki>{</nowiki>Ruminations on <nowiki>{</nowiki>T<nowiki>}</nowiki>arjan's <nowiki>{</nowiki>U<nowiki>}</nowiki>nion-<nowiki>{</nowiki>F<nowiki>}</nowiki>ind algorithm and |
||
connected operators<nowiki>}</nowiki>, |
connected operators<nowiki>}</nowiki>, |
||
| + | booktitle = <nowiki>{</nowiki>Proceedings of the 7th International Symposium on |
||
| − | booktitle = ismm05, |
||
| + | Mathematical Morphology (ISMM'05)<nowiki>}</nowiki>, |
||
year = 2005, |
year = 2005, |
||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
volume = 30, |
volume = 30, |
||
| ⚫ | |||
abstract = <nowiki>{</nowiki>This papers presents a comprehensive and general form of |
abstract = <nowiki>{</nowiki>This papers presents a comprehensive and general form of |
||
the Tarjan's union-find algorithm dedicated to connected |
the Tarjan's union-find algorithm dedicated to connected |
||
| Line 38: | Line 35: | ||
preservation and, as a consequence, we show how we can rely |
preservation and, as a consequence, we show how we can rely |
||
on ``union-find'' to obtain algorithms for self-dual |
on ``union-find'' to obtain algorithms for self-dual |
||
| − | filters approaches and levelings with a marker function.<nowiki>}</nowiki> |
+ | filters approaches and levelings with a marker function.<nowiki>}</nowiki>, |
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 16:20, 5 February 2018
- Authors
- Thierry Géraud
- Where
- Proceedings of the 7th International Symposium on Mathematical Morphology (ISMM'05)
- Place
- Paris, France
- Type
- inproceedings
- Publisher
- Springer
- Projects
- Olena
- Keywords
- Image
- Date
- 2005-01-05
Abstract
This papers presents a comprehensive and general form of the Tarjan's union-find algorithm dedicated to connected operators. An interesting feature of this form is to introduce the notion of separated domains. The properties of this form and its flexibility are discussed and highlighted with examples. In particular, we give clues to handle correctly the constraint of domain-disjointness preservation and, as a consequence, we show how we can rely on “union-find” to obtain algorithms for self-dual filters approaches and levelings with a marker function.
Bibtex (lrde.bib)
@InProceedings{ geraud.05.ismm,
author = {Thierry G\'eraud},
title = {Ruminations on {T}arjan's {U}nion-{F}ind algorithm and
connected operators},
booktitle = {Proceedings of the 7th International Symposium on
Mathematical Morphology (ISMM'05)},
year = 2005,
volume = 30,
pages = {105--116},
abstract = {This papers presents a comprehensive and general form of
the Tarjan's union-find algorithm dedicated to connected
operators. An interesting feature of this form is to
introduce the notion of separated domains. The properties
of this form and its flexibility are discussed and
highlighted with examples. In particular, we give clues to
handle correctly the constraint of domain-disjointness
preservation and, as a consequence, we show how we can rely
on ``union-find'' to obtain algorithms for self-dual
filters approaches and levelings with a marker function.},
address = {Paris, France},
month = apr,
publisher = {Springer},
series = {Computational Imaging and Vision}
}