4D Minimal Non-simple Sets

  • C. J. Gau
  • T. Yung Kong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2301)

Abstract

One method of verifying that a given parallel thinning algorithm “preserves topology” is to show that no iteration ever deletes a minimal non-simple (“MNS”) set of 1’s. The practicality of this method depends on the fact that few types of set can be MNS without being a component. The problem of finding all such types of set has been solved (by Ronse, Hall, Ma, and the authors) for 2D and 3D Cartesian grids, and for 2D hexagonal and 3D face-centered cubic grids. Here we solve this problem for a 4D Cartesian grid, in the case where 80-adjacency is used on 1’s and 8-adjacency on 0’s.

Keywords

4D xel attachment minimal non-simple MNS parallel thinning 

References

  1. 1.
    Ronse, C.: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Applied Mathematics 21 (1988) 67–79MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Hall, R.W.: Tests for connectivity preservation for parallel reduction operators. Topology and Its Applications 46 (1992) 199–217MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Ma, C.M.: On topology preservation in 3D thinning. CVGIP: Image Understanding 59 (1994) 328–339CrossRefGoogle Scholar
  4. 4.
    Gau, C.J., Kong, T.Y.: Minimal nonsimple sets of voxels in binary images on a facecentered cubic grid. International Journal of Pattern Recognition and Artificial Intelligence 13 (1999) 485–502CrossRefGoogle Scholar
  5. 5.
    Kong, T.Y.: On topology preservation in 2D and 3D thinning. International Journal of Pattern Recognition and Artificial Intelligence 9 (1995) 813–844CrossRefGoogle Scholar
  6. 6.
    Kong, T.Y.: Topology preserving deletion of 1’s from 2-, 3-and 4-dimensional binary images. In Ahronovitz, E., Fiorio, C., eds.: Discrete Geometry for Computer Imagery: 7th International Workshop (DGCI’ 97, Montpellier, France, December 1997), Proceedings. Springer (1997) 3–18Google Scholar
  7. 7.
    Kong, T.Y., Roscoe, A.W.: Characterizations of simply-connected finite polyhedra in 3-space. Bulletin of the London Mathematical Society 17 (1985) 575–578MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Saha, P.K., Kong, T.Y., Rosenfeld, A.: Strongly normal sets of tiles in N dimensions. Electronic Notes in Theoretical Computer Science 46 (2001) URL: http://www.elsevier.nl/locate/entcs/volume46.html
  9. 9.
    Spanier, E.H.: Algebraic Topology. Springer (1989)Google Scholar
  10. 10.
    Maunder, C.R.F.: Algebraic Topology. Dover (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • C. J. Gau
    • 1
  • T. Yung Kong
    • 2
  1. 1.Department of Computer Science Graduate School and University CenterCity University of New YorkNew YorkUSA
  2. 2.Department of Computer ScienceQueens College City University of New YorkFlushingUSA

Personalised recommendations