An introduction to simple sets

Preserving topological properties of objects during thinning procedures is an important issue in the field of image analysis. In this context, we present an introductory study of the new notion of simple set which extends the classical notion of simple point. Similarly to simple points, simple sets have the property that the homotopy type of the object in which they lie is not changed when such sets are removed. Simple sets are studied in the framework of cubical complexes which enables, in particular, to model the topology in Z^n. The main contributions of this article are: a justification of the study of simple sets (motivated by the limitations of simple points); a definition of simple sets and of a subfamily of them called minimal simple sets; the presentation of general properties of (minimal) simple sets in n-D spaces, and of more specific properties related to ''small dimensions'' (these properties being devoted to be further involved in studies of simple sets in 2,3 and 4-D spaces).

[1]  J. van Mill,et al.  Open Problems in Topology , 1990 .

[2]  Gilles Bertrand,et al.  Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels , 2008, Journal of Mathematical Imaging and Vision.

[3]  T. Yung Kong,et al.  Topology-Preserving Deletion of 1's from 2-, 3- and 4-Dimensional Binary Images , 1997, DGCI.

[4]  Vladimir A. Kovalevsky,et al.  Finite topology as applied to image analysis , 1989, Comput. Vis. Graph. Image Process..

[5]  J. Craggs.  Applied Mathematical Sciences , 1973 .

[6]  Rémy Malgouyres,et al.  A concise characterization of 3D simple points , 2003, Discret. Appl. Math..

[7]  Gilles Bertrand,et al.  New Characterizations of Simple Points in 2D, 3D, and 4D Discrete Spaces , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Nicolas Passat,et al.  Using Multimodal MR Data for Segmentation and Topology Recovery of the Cerebral Superficial Venous Tree , 2005, ISVC.

[9]  Christophe Lohou,et al.  Liver Blood Vessels Extraction by a 3-D Topological Approach , 1999, MICCAI.

[10]  Gilles Bertrand,et al.  Minimal Simple Pairs in the 3-D Cubic Grid , 2008, Journal of Mathematical Imaging and Vision.

[11]  T. Yung Kong,et al.  Minimal non-simple sets in 4D binary images , 2003, Graph. Model..

[12]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.

[13]  Gilles Bertrand,et al.  Topology-Preserving Thinning in 2-D Pseudomanifolds , 2009, DGCI.

[14]  E. R. Davies,et al.  Thinning algorithms: A critique and a new methodology , 1981, Pattern Recognit..

[15]  Gilles Bertrand,et al.  On P-simple points , 1995 .

[16]  J. Whitehead.  Simplicial Spaces, Nuclei and m‐Groups , 1939 .

[17]  T. Yung Kong,et al.  On Topology Preservation in 2-D and 3-D Thinning , 1995, Int. J. Pattern Recognit. Artif. Intell..

[18]  P. Giblin.  Graphs, surfaces, and homology , 1977 .

[19]  Michel Couprie,et al.  Discrete bisector function and Euclidean skeleton in 2D and 3D , 2007, Image Vis. Comput..

[20]  Gilles Bertrand,et al.  Simple points, topological numbers and geodesic neighborhoods in cubic grids , 1994, Pattern Recognit. Lett..

[21]  Cherng Min Ma,et al.  On topology preservation in 3D thinning , 1994 .

[22]  Christian Ronse,et al.  Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images , 1988, Discret. Appl. Math..

[23]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[24]  Nicolas Passat,et al.  On 2-dimensional Simple Sets in n-dimensional Cubic Grids , 2010, Discret. Comput. Geom..

[25]  Gilles Bertrand,et al.  On critical kernels , 2007 .