Difference between revisions of "Publications/geraud.05.ismm"
From LRDE
Line 10: | Line 10: | ||
| series = Computational Imaging and Vision |
| series = Computational Imaging and Vision |
||
| volume = 30 |
| volume = 30 |
||
− | | |
+ | | lrdeprojects = Image |
− | | urllrde = 200504-ISMM |
||
| 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 |
||
Line 30: | Line 29: | ||
series = <nowiki>{</nowiki>Computational Imaging and Vision<nowiki>}</nowiki>, |
series = <nowiki>{</nowiki>Computational Imaging and Vision<nowiki>}</nowiki>, |
||
volume = 30, |
volume = 30, |
||
− | project = <nowiki>{</nowiki>Image<nowiki>}</nowiki>, |
||
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 |
Revision as of 12:14, 26 April 2016
- Authors
- Thierry Géraud
- Where
- ismm05
- Place
- Paris, France
- Type
- inproceedings
- Publisher
- Springer
- Projects
- Image"Image" is not in the list (Vaucanson, Spot, URBI, Olena, APMC, Tiger, Climb, Speaker ID, Transformers, Bison, ...) of allowed values for the "Related project" property.
- 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 = ismm05, year = 2005, address = {Paris, France}, month = apr, pages = {105--116}, publisher = {Springer}, series = {Computational Imaging and Vision}, 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.} }