A Comparison of Many Max-tree Computation Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

A Comparison of Many Max-tree Computation Algorithms


With the development of connected filters in the last decade, many algorithms have been proposed to compute the max-tree. Max-tree allows computation of the most advanced connected operators in a simple way. However, no exhaustive comparison of these algorithms has been proposed so far and the choice of an algorithm over another depends on many parameters. Since the need for fast algorithms is obvious for production code, we present an in depth comparison of five algorithms and some variations of them in a unique framework. Finally, a decision tree will be proposed to help the user choose the most appropriate algorithm according to their requirements.
Fichier principal
Vignette du fichier
carlinet.2013.ismm.pdf (438.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01476238 , version 1 (24-02-2017)



Edwin Carlinet, Thierry Géraud. A Comparison of Many Max-tree Computation Algorithms. 11th International Symposium on Mathematical Morphology (ISMM), May 2013, Uppsala, Sweden. pp.73 - 85, ⟨10.1007/978-3-642-38294-9_7⟩. ⟨hal-01476238⟩
177 View
960 Download



Gmail Facebook X LinkedIn More