A parallel thinning algorithm for grayscale images

Authors:
Michel Couprie;Nivando Bezerra;Gilles Bertrand
Affiliations:
Laboratoire d'Informatique Gaspard-Monge, Équipe A3SI, ESIEE Paris, Université Paris-Est, France;Instituto Federal do Ceará, IFCE, Maracanaú, Brazil;Laboratoire d'Informatique Gaspard-Monge, Équipe A3SI, ESIEE Paris, Université Paris-Est, France
Venue:
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Year:
2013

Citing 7
Cited 0

Digital topology: introduction and survey

Computer Vision, Graphics, and Image Processing
A new thinning algorithm for gray-scale images by the relaxation technique

Pattern Recognition
Order independent homotopic thinning for binary and grey tone anchored skeletons

Pattern Recognition Letters
Gray-scale thinning by using a pseudo-distance map

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02
Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels

Journal of Mathematical Imaging and Vision
Thinning Algorithms for Gray-Scale Pictures

IEEE Transactions on Pattern Analysis and Machine Intelligence
The fuzzy geometry of image subsets

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Grayscale skeletonization offers an interesting alternative to traditional skeletonization following a binarization. It is well known that parallel algorithms for skeletonization outperform sequential ones in terms of quality of results, yet no general and well defined framework has been proposed until now for parallel grayscale thinning. We introduce in this paper a parallel thinning algorithm for grayscale images, and prove its topological soundness based on properties of the critical kernels framework. The algorithm and its proof, given here in the 2D case, are also valid in 3D. Some applications are sketched in conclusion.