How to Make n-D Plain Maps defined on Discrete Surfaces Alexandrov-Well-Composed in a Self-dual Way - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Mathematical Imaging and Vision Année : 2019

How to Make n-D Plain Maps defined on Discrete Surfaces Alexandrov-Well-Composed in a Self-dual Way

Résumé

In 2013, Najman and Géraud proved that by working on a well-composed discrete representation of a gray-level image, we can compute what is called its tree of shapes, a hierarchical representation of the shapes in this image. This way, we can proceed to morphological filtering and to image segmentation. However , the authors did not provide such a representation for the non-cubical case. We propose in this paper a way to compute a well-composed representation of any gray-level image defined on a discrete surface, which is a more general framework than the usual cubical grid. Furthermore, the proposed representation is self-dual in the sense that it treats bright and dark components in the image the same way. This paper can be seen as an extension to gray-level images of the works of Daragon et al. on discrete surfaces.
Fichier principal
Vignette du fichier
boutry.2017.hal-interpolationAWC-2019-02-04.pdf (1.41 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02005579 , version 1 (04-02-2019)

Identifiants

Citer

Nicolas Boutry, Thierry Géraud, Laurent Najman. How to Make n-D Plain Maps defined on Discrete Surfaces Alexandrov-Well-Composed in a Self-dual Way. Journal of Mathematical Imaging and Vision, 2019, 61, pp.849-973. ⟨10.1007/s10851-019-00873-4⟩. ⟨hal-02005579⟩
80 Consultations
86 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More