A Proof of the Tree of Shapes in n-D

06/10/2022
by   Thierry Géraud, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset