A topological characterization of thinning
Theoretical Computer Science
Discrete Applied Mathematics
On topology preservation in 3D thinning
CVGIP: Image Understanding
Detection of 3-D Simple Points for Topology Preserving Transformations with Application to Thinning
IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple points, topological numbers and geodesic neighborhoods in cubic grids
Pattern Recognition Letters
A Boolean characterization of three-dimensional simple points
Pattern Recognition Letters
Handbook of combinatorics (vol. 2)
A 3D 6-subiteration thinning algorithm for extracting medial lines
Pattern Recognition Letters
A parallel 3D 12-subiteration thinning algorithm
Graphical Models and Image Processing
Parallel thinning algorithms on 3D (18,6) binary images
Computer Vision and Image Understanding
Geometry of Digital Spaces
Digital Picture Processing
Minimal non-simple sets in 4D binary images
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Surface Skeletons in Grids with Non-Cubic Voxels
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Strongly normal sets of contractible tiles in N dimensions
Pattern Recognition
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
On the detection of simple points in higher dimensions using cubical homology
IEEE Transactions on Image Processing
On Parallel Thinning Algorithms: Minimal Non-simple Sets, P-simple Points and Critical Kernels
Journal of Mathematical Imaging and Vision
Topological Properties of Thinning in 2-D Pseudomanifolds
Journal of Mathematical Imaging and Vision
| Hi-index | 5.23 |
The concepts of strongly 8-deletable and strongly 4-deletable sets of 1s in binary images on the 2D Cartesian grid were introduced by Ronse in the mid-1980s to formalize the connectivity preservation conditions that parallel thinning algorithms are required to satisfy. In this paper we call these sets deletable and codeletable, respectively. To establish that a proposed parallel thinning algorithm for binary images on the 2D Cartesian grid preserves 8-(4-)connected foreground components and 4-(8-)connected background components, it is enough to prove that the set of 1s which are changed to 0s at each pass of the algorithm is always a deletable (codeletable) set. Ronse established results that are very useful in this context for proving that a finite set D of 1s is deletable or codeletable. In particular, he showed that D and its proper subsets are all codeletable in a binary image if each singleton and each pair of 8-adjacent pixels in D is codeletable. He further showed that D and its proper subsets are all deletable in a binary image if (1) each singleton and each pair of 4-adjacent pixels in D is deletable, and (2) no set of 2, 3, or 4 pairwise 8-adjacent pixels that is an 8-connected foreground component of the image is entirely contained in D. In the 1990s and early 2000s analogous results were obtained by Hall, Ma, Gau, and the author for binary images on the 2D hexagonal grid, the 3D Cartesian and face-centered cubic grids, and the 4D Cartesian grid. This paper extends the above-mentioned work to binary images on almost any polytopal complex whose union is n-dimensional Euclidean space, for n@?4. Our main results generalize and unify the corresponding results of the earlier work.