Nearness in Digital Images and Proximity Spaces

  • Pavel Pták
  • Walter G. Kropatsch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1953)


The concept of “nearness”, which has been dealt with as soon as one started studying digital images, finds one of its rigorous forms in the notion of proximity space. It is this notion, together with “nearness preserving mappings”, that we investigate in this paper. We first review basic examples as they naturally occur in digital topologies, making also brief comparison studies with other concepts in digital geometry. After this we characterize proximally continuous mappings in metric spaces. Finally, we show by example that the “proximite complexity” of a finite covering in a digital picture may be too high to be adequately depicted in a finite topological space. This combinatorial result may indicate another conceptual advantage of proximities over topologies.


  1. 1.
    P. Alexandro.: Elementary Concepts of Topology, A translation of P. Alexandro., 1932, by A. E. Farley, Dover, New York, 1961Google Scholar
  2. 2.
    L. Boxer: Digitally continuous functions, Pattern Recognition Lett. 15 (1994), 833–839 69zbMATHCrossRefGoogle Scholar
  3. 3.
    E. Cech: Topological Spaces, J. Wiley-Interscience Publ., New York, (1966) 70, 71, 72zbMATHGoogle Scholar
  4. 4.
    J.-M. Chassery: Connectivity and consecutivity in digital pictures, Computer Graphics and Image Processing 9 (1979), 294–300 69CrossRefGoogle Scholar
  5. 5.
    J. Isbell: Uniform Spaces, Publ. AMS, Providence, (1968) 70, 72, 73Google Scholar
  6. 6.
    H. Herrlich: A concept of nearness, General Topology Appl. 5 (1974), 191–212 70CrossRefMathSciNetGoogle Scholar
  7. 7.
    E. R. Khalinsky, E. R. Kopperman and P. R. Meyer: Computer graphics and connected topologies on finite ordered sets, Topology Appl. 36, 117, (1990)CrossRefMathSciNetGoogle Scholar
  8. 8.
    T. Y. Kong and A. Rosenfeld: Digital topology: introduction and survey, Computer Vision, Graphics, and Image Processing 48 (1989), 367–393 69, 75CrossRefGoogle Scholar
  9. 9.
    T. Y. Kong: On the problem of determining whether a parallel reduction operator of n-dimensional binary images always preserves topology, Proc. SPIE’s Conf. on Vision Geometry, (1993), 69–77 69Google Scholar
  10. 10.
    V. A. Kovalevski: Finite topology as applied to image analysis, Computer Vision, Graphics and Image Processing 46, (1989), 141–161 75CrossRefGoogle Scholar
  11. 11.
    W. Kropatsch, P. Pták: The path-connectedness in Z2 and Z3 and classical topologies. Advances in Pattern Recognition, Joint IAPR International Workshops SSPR’98 and SPR’98, Sydney 1998, Springer Verlag-Lecture Notes in Computer Science Vol. 1451, 181–189 71, 75, 76CrossRefGoogle Scholar
  12. 12.
    L. Latecki, F. Prokop: Semi-proximity continuous functions in digital images, Pattern Recognition Letters 16 (1995), 1175–1187 69, 70, 71CrossRefGoogle Scholar
  13. 13.
    L. Latecki: Topological connectedness and 8-connectedness in digital pictures, Computer Vision, Graphics and Image Processing: Image Understanding 57, (1993), 261–262 69, 75, 76CrossRefGoogle Scholar
  14. 14.
    S. A. Naimpally and B. D. Warrack: Proximity Spaces, Cambridge Univ. Press, Cambridge 1970 70zbMATHGoogle Scholar
  15. 15.
    J. Pelant, P. Pták: The complexity of ó-discretely decomposable families in uniform spaces, Comm. Math. Univ. Carolinae 22 (1981), 317–326zbMATHGoogle Scholar
  16. 16.
    F. Riesz: Stetigkeitsbegri. und abstrakte Mengenlehre, Atti IV Congresso Internazionale dei Matematici, Roma, 1908, Vol. II, 18–24 70Google Scholar
  17. 17.
    A. Rosenfeld: Digital topology, Am. Math. Monthly 86, (1979), 621–630 73zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    A. Rosenfeld: “Continuous” functions on digital pictures, Pattern Recognition Lett. 4, (1986), 177–184 69, 73, 75zbMATHCrossRefGoogle Scholar
  19. 19.
    A. Rosenfeld and J. L. Pfaltz: Sequential operations in digital picture processing, J. Assoc. Comput. Mach. 13, (1966), 471–494 73zbMATHGoogle Scholar
  20. 20.
    F. Wyse and D. Marcus et al.: Solution to Problem 5712, Am. Math. Monthly 77, 1119, 1970 71, 75CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Pavel Pták
    • 1
  • Walter G. Kropatsch
    • 2
  1. 1.Faculty of Electrical EngineeringCMP - Czech Technical University Center for Machine PerceptionPraha 2Czech Republic
  2. 2.Institute of Computer Aided Automation 183/2Vienna University of Technology Pattern Recognition and Image Processing GroupWienAustria

Personalised recommendations