MB: a coherent collection of 2D parallel thinning algorithms - ENSTA Paris - École nationale supérieure de techniques avancées Paris Access content directly
Reports (Research Report) Year : 2002

MB: a coherent collection of 2D parallel thinning algorithms

Antoine Manzanera

Abstract

We present new thinning algorithms to compute the digital skeletons of binary 2D images. Starting from a physical characterization of the thinning process, we show that the mere incorporation of discrete topology preservation conditions leads to the Boolean definition of different parallel thinning algorithms, depending on the topological and metrical properties that can be basically desired in the square grid. The complete Boolean definition of every algorithm is provided through a coherent set of removing and non-removing conditions. For every algorithm, logic minimization is addressed, and the implementation on a Boolean cellular automata grid is proposed. Beyond the implementation, we stress the advantages of Boolean concision in terms of complexity reduction. Some results are shown and discussed.
Fichier principal
Vignette du fichier
MB2D.pdf (441.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01222700 , version 1 (30-10-2015)

Identifiers

  • HAL Id : hal-01222700 , version 1

Cite

Antoine Manzanera, Thierry Bernard. MB: a coherent collection of 2D parallel thinning algorithms. [Research Report] ENSTA ParisTech. 2002. ⟨hal-01222700⟩
48 View
469 Download

Share

Gmail Facebook X LinkedIn More