A Comparative Review of Component Tree Computation Algorithms

Edwin Carlinet (1, 2) , Thierry Géraud (1)

1 LRDE - Laboratoire de Recherche et de Développement de l'EPITA
2 LIGM - Laboratoire d'Informatique Gaspard-Monge

Connected operators are morphological tools that have the property of filtering images without creating new contours and without moving the contours that are preserved. Those operators are related to the max-tree and min-tree representations of images, and many algorithms have been proposed to compute those trees. 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 the existing algorithms in a unique framework, as well as variations of some of them that improve their efficiency. This comparison involves both sequential and parallel algorithms, and execution times are given w.r.t. the number of threads, the input image size, and the pixel value quantization. Eventually, a decision tree is given to help the user choose the most appropriate algorithm with respect to the user requirements. To favor reproducible research, an online demo allows the user to upload an image and bench the different algorithms, and the source code of every algorithms has been made available.

Mots clés: Component tree; max-tree; min-tree; connected operators; filtering; mathematical morphology; algorithms

Domaines: Traitement des images [eess.IV]

Edwin Carlinet, Thierry Géraud. A Comparative Review of Component Tree Computation Algorithms. IEEE Transactions on Image Processing, 2014, 23 (9), pp.3885 - 3895. ⟨10.1109/TIP.2014.2336551⟩. ⟨hal-01474830⟩