A 3D 12-subiteration thinning algorithm based on P-simple points

  • Authors:
  • Christophe Lohou;Gilles Bertrand

  • Affiliations:
  • Laboratoire d'Algorithmique et Architecture des Systèmes Informatiques (A2 SI), École Supérieure d'Ingénieurs en Électrotechnique et Électronique (ESIEE), Noisy-le-Gr ...;Laboratoire d'Algorithmique et Architecture des Systèmes Informatiques (A2SI), École Supérieure d'Ingénieurs en Électrotechnique et Électronique (ESIEE), Noisy-le-Gra ...

  • Venue:
  • Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the opposite of the already proposed thinning algorithms based on P-simple points. Moreover, from an existent thinning algorithm A, we construct another thinning algorithm A', such that A' deletes at least all the points removed by A, while preserving the same end points. In fact, we propose a 12-subiteration thinning algorithm which deletes at least the points removed by the one proposed by Palágyi and Kuba (Graphical Models Image Process. 61 (1999) 199).