On Parallel Thinning Algorithms: Minimal Non-simple Sets, P-simple Points and Critical Kernels

Authors:
Gilles Bertrand;Michel Couprie
Affiliations:
Université Paris-Est, Laboratoire d'Informatique Gaspard-Monge, Équipe A3SI, ESIEE-Paris, Marne-la-Vallée, France;Université Paris-Est, Laboratoire d'Informatique Gaspard-Monge, Équipe A3SI, ESIEE-Paris, Marne-la-Vallée, France
Venue:
Journal of Mathematical Imaging and Vision
Year:
2009

Citing 15
Cited 6

Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images

Discrete Applied Mathematics
Finite topology as applied to image analysis

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

Computer Vision, Graphics, and Image Processing
On topology preservation in 3D thinning

CVGIP: Image Understanding
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
Minimal non-simple sets in 4D binary images

Graphical Models - Special issue: Discrete topology and geometry for image and object representation
A 3D 12-subiteration thinning algorithm based on P-simple points

Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
A 3D 6-subiteration curve thinning algorithm based on P-simple points

Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels

Journal of Mathematical Imaging and Vision
Minimal non-deletable sets and minimal non-codeletable sets in binary images

Theoretical Computer Science
New Characterizations of Simple Points in 2D, 3D, and 4D Discrete Spaces

IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimal non-simple sets in 4-dimensional binary images with (8,80)-adjacency

IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Minimal non-simple and minimal non-cosimple sets in binary images on cell complexes

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
A new 3d parallel thinning scheme based on critical kernels

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery

Surface Thinning in 3D Cubical Complexes

IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Homological methods for extraction and analysis of linear features in multidimensional images

Pattern Recognition
Robust algorithm for tunnel closing in 3D volumetric objects based on topological characteristics of points

Pattern Recognition Letters
2D parallel thinning and shrinking based on sufficient conditions for topology preservation

Acta Cybernetica
Homological spanning forest framework for 2D image analysis

Annals of Mathematics and Artificial Intelligence
Powerful Parallel and Symmetric 3D Thinning Schemes Based on Critical Kernels

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

Critical kernels constitute a general framework in the category of abstract complexes for the study of parallel homotopic thinning in any dimension. In this article, we present new results linking critical kernels to minimal non-simple sets (MNS) and P-simple points, which are notions conceived to study parallel thinning in discrete grids. We show that these two previously introduced notions can be retrieved, better understood and enriched in the framework of critical kernels. In particular, we propose new characterizations which hold in dimensions 2, 3 and 4, and which lead to efficient algorithms for detecting P-simple points and minimal non-simple sets.