Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension

David Coeurjolly (1)

1 M2DisCo - Geometry Processing and Constrained Optimization

In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since it allows us to define a local thickness distribution. The proposed algorithm can be defined in arbitrary dimension thanks to the existing techniques to compute the discrete power diagram.

Domaines: Traitement des images [eess.IV]

David Coeurjolly. Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension. IEEE International Conference on Pattern Recognition (ICPR 2010), Aug 2010, Istanbul, Turkey. pp.4. ⟨hal-00529820⟩