Convexity Preserving Contraction of Digital Sets - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Convexity Preserving Contraction of Digital Sets

Lama Tarsissi
David Coeurjolly
Yukiko Kenmochi


Convexity is one of the useful geometric properties of digital sets in digital image processing. There are various applications which require deforming digital convex sets while preserving their convexity. In this article, we consider the contraction of such digital sets by removing digital points one by one. For this aim, we use some tools of combina-torics on words to detect a set of removable points and to define such convexity-preserving contraction of a digital set as an operation of rewriting its boundary word. In order to chose one of removable points for each contraction step, we present three geometrical strategies, which are related to vertex angle and area changes. We also show experimental results of applying the methods to repair some non-convex digital sets, which are obtained by rotations of convex digital sets.
Fichier principal
Vignette du fichier
convexit__digitale(5).pdf (1.04 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02315084 , version 1 (14-10-2019)
hal-02315084 , version 2 (10-03-2020)



Lama Tarsissi, David Coeurjolly, Yukiko Kenmochi, Pascal Romon. Convexity Preserving Contraction of Digital Sets. The 5th Asian Conference on Pattern Recognition (ACPR 2019), Nov 2019, Auckland, New Zealand. pp.611-624, ⟨10.1007/978-3-030-41299-9_48⟩. ⟨hal-02315084v2⟩
426 View
228 Download



Gmail Mastodon Facebook X LinkedIn More