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

9Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

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) fore-ground 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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Kong, T. Y. (2006). Minimal non-simple and minimal non-cosimple sets in binary images on cell complexes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4245 LNCS, pp. 169–188). Springer Verlag. https://doi.org/10.1007/11907350_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free