Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A Proof of the Tree of Shapes in n-D

Abstract : In this paper, we prove that the self-dual morphological hierarchical structure computed on a n-D gray-level wellcomposed image u by the algorithm of Géraud et al. [1] is exactly the mathematical structure defined to be the tree of shape of u in Najman et al [2]. We recall that this algorithm is in quasi-linear time and thus considered to be optimal. The tree of shapes leads to many applications in mathematical morphology and in image processing like grain filtering, shapings, image segmentation, and so on.
Complete list of metadata
Contributor : Laurent Najman Connect in order to contact the contributor
Submitted on : Wednesday, June 8, 2022 - 10:18:22 AM
Last modification on : Friday, June 24, 2022 - 4:05:32 AM



  • HAL Id : hal-03690353, version 1
  • ARXIV : 2206.05109



Thierry Géraud, Nicolas Boutry, Sébastien Crozet, Edwin Carlinet, Laurent Najman. A Proof of the Tree of Shapes in n-D. 2022. ⟨hal-03690353⟩



Record views


Files downloads