A Comparison of Many Max-tree Computation Algorithms

Abstract : 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.
Type de document :
Communication dans un congrès
11th International Symposium on Mathematical Morphology (ISMM), May 2013, Uppsala, Sweden. pp.73 - 85, 2013, 〈10.1007/978-3-642-38294-9_7〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01476238
Contributeur : Thierry Géraud <>
Soumis le : vendredi 24 février 2017 - 16:29:17
Dernière modification le : mardi 17 avril 2018 - 16:22:52
Document(s) archivé(s) le : jeudi 25 mai 2017 - 13:40:17

Fichier

carlinet.2013.ismm.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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, 2013, 〈10.1007/978-3-642-38294-9_7〉. 〈hal-01476238〉

Partager

Métriques

Consultations de la notice

187

Téléchargements de fichiers

65