Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01476238
Contributor : Thierry Géraud <>
Submitted on : Friday, February 24, 2017 - 4:29:17 PM
Last modification on : Wednesday, December 18, 2019 - 1:50:33 AM
Long-term archiving on: : Thursday, May 25, 2017 - 1:40:17 PM

File

carlinet.2013.ismm.pdf
Files produced by the author(s)

Identifiers

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

Share

Metrics

Record views

327

Files downloads

669