Difference between revisions of "Publications/geraud.05.ismm"
From LRDE
(Created page with "{{Publication | date = 2005-04-01 | authors = Thierry Géraud | title = Ruminations on Tarjan's Union-Find algorithm and connected operators | booktitle = ismm05 | address = P...") |
|||
Line 12: | Line 12: | ||
| urllrde = 200504-ISMM |
| 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 |
||
| type = inproceedings |
| type = inproceedings |
||
| id = geraud.05.ismm |
| id = geraud.05.ismm |
||
Line 37: | Line 38: | ||
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>, |
+ | lrdekeywords = <nowiki>{</nowiki>Image<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Revision as of 18:07, 4 November 2013
- Authors
- Thierry Géraud
- Where
- ismm05
- Place
- Paris, France
- Type
- inproceedings
- Publisher
- Springer
- Keywords
- Image
- Date
- 2005-04-01
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, project = {Image}, 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} }