New 2d parallel thinning algorithms based on critical kernels

Authors:
Gilles Bertrand;Michel Couprie
Affiliations:
Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE, Cité Descartes, Noisy-le-Grand, France;Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE, Cité Descartes, Noisy-le-Grand, France
Venue:
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Year:
2006

Citing 11
Cited 4

A one-pass thinning algoruthm and its parallel implementation

Computer Vision, Graphics, and Image Processing
Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images

Discrete Applied Mathematics
Fast parallel thinning algorithms: parallel speed and connectivity preservation

Communications of the ACM
Finite topology as applied to image analysis

Computer Vision, Graphics, and Image Processing
Digital topology: introduction and survey

Computer Vision, Graphics, and Image Processing
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
Connectivity in Digital Pictures

Journal of the ACM (JACM)
Some Parallel Thinning Algorithms for Digital Pictures

Journal of the ACM (JACM)
Topology-Preserving Deletion of 1's from 2-, 3- and 4-Dimensional Binary Images

DGCI '97 Proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery
Strong thinning and polyhedric approximation of the surface of a voxel object

Discrete Applied Mathematics
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology

Minimal Simple Pairs in the 3-D Cubic Grid

Journal of Mathematical Imaging and Vision
New characterizations of simple points, minimal non-simple sets and P-simple points in 2D, 3D and 4D discrete spaces

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Minimal simple pairs in the cubic grid

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
An improved contour-based thinning method for character images

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. In this context, we propose several new parallel algorithms, which are both fast and simple to implement, to obtain symmetrical skeletons of 2D objects in 2D or 3D grids. We prove some properties of these skeletons, related to topology preservation, and to the inclusion of the topological axis which may be seen as a generalization of the medial axis.