Advertisement

Topology-preserving deletion of 1's from 2-, 3- and 4-dimensional binary images

  • T. Yung Kong
Invited Speakers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1347)

Abstract

In digital topology, a 1 in a binary image is said to be simple if its deletion from the image “preserves topology”. Two (closely related) sets of necessary and sufficient conditions for a 1 in a 2-, 3- or 4-dimensional binary image to be simple are established. The 4-dimensional cases of these results may be regarded as the principal contribution of this paper. A different discrete characterization of simple 1's in 2-, 3-and 4-dimensional binary images, discovered by A. W. Roscoe and the author, is also presented (without proof).

Keywords

Binary Image Euler Characteristic Generalize Image Free Face Digital Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    M. A. Armstrong, Basic Topology, Springer-Verlag, New York, 1983.Google Scholar
  2. 2.
    S. S. Cairns, Introductory Topology, Ronald Press, New York, 1968.Google Scholar
  3. 3.
    T. Y. Kong, On topology preservation in 2-D and 3-D thinning, International Journal of Pattern Recognition and Artificial Intelligence 9, 1995, 813–844.Google Scholar
  4. 4.
    T. Y. Kong and A. W. Roscoe, Characterizations of simply-connected finite polyhedra in 3-space, Bulletin of the London Mathematical Society 17, 1985, 575–578.Google Scholar
  5. 5.
    T. Y. Kong and A. W. Roscoe, Simple Points in 4-Dimensional (and Higher-Dimensional) Binary Images. Paper in preparation.Google Scholar
  6. 6.
    G. Malandain and G. Bertrand, Fast characterization of 3D simple points, Proceedings, 11th IAPR International Conference on Pattern Recognition, Volume 111, The Hagues, The Netherlands, 1992, 232–235.Google Scholar
  7. 7.
    A. Rosenfeld, Connectivity in digital pictures, J. ACM 17, 1970, 146–160.Google Scholar
  8. 8.
    P. K. Saha, B. Chanda and D. D. Majumder, Principles and Algorithms for 2D and 3D Shrinking, Technical Report TR/KBCS/2/91, N. C. K. B. C. S. Library, Indian Statistical Institute, Calcutta, India, 1991.Google Scholar
  9. 9.
    Y. F. Tsao and K. S. Fu, A 3D parallel skeletonwise thim-drig algorithm, Proceedings, IEEE Computer Society Conference on Pattern Recognition and Image Processing, 1982, 678–683.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • T. Yung Kong
    • 1
  1. 1.Department of Computer ScienceQueens College, CUNYFlushingUSA

Personalised recommendations