Minimal non-simple and minimal non-cosimple sets in binary images on cell complexes

Authors:
T. Yung Kong
Affiliations:
Department of Computer Science, Queens College, City University of New York, Flushing, NY
Venue:
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Year:
2006

Citing 11
Cited 5

A topological characterization of thinning

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

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
A Boolean characterization of three-dimensional simple points

Pattern Recognition Letters
Topological methods

Handbook of combinatorics (vol. 2)
Connectivity in Digital Pictures

Journal of the ACM (JACM)
Geometry of Digital Spaces

Geometry of Digital Spaces
Minimal non-simple sets in 4D binary images

Graphical Models - Special issue: Discrete topology and geometry for image and object representation
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

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
On Parallel Thinning Algorithms: Minimal Non-simple Sets, P-simple Points and Critical Kernels

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
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

The concepts of weak component and simple 1 are generalizations, to binary images on the n-cells of n-dimensional cell complexes, of the standard concepts of “26-component” and “26-simple” 1 in binary images on the 3-cells of a 3D cubical complex; the concepts of strong component and cosimple 1 are generalizations of the concepts of “6-component” and “6-simple” 1 Over the past 20 years, the problems of determining just which sets of 1's can be minimal non-simple, just which sets can be minimal non-cosimple, and just which sets can be minimal non-simple (minimal non-cosimple) without being a weak (strong) foreground component have been solved for the 2D cubical and hexagonal, 3D cubical and face-centered-cubical, and 4D cubical complexes This paper solves these problems in much greater generality, for a very large class of cell complexes of dimension ≤4.