Semi-proximity continuous functions in digital images

  • Authors:
  • Longin Latecki;Frank Prokop

  • Affiliations:
  • Department of Computer Science, University of Hamburg. Vogt-Kölln-Str. 30, 22527 Hamburg, Germany;Department of Mathematics, University of Wollongong, Wollongong. N.S.W. 2522, Australia

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 1995

Quantified Score

Hi-index 0.10

Visualization

Abstract

Starting with the intuitive concept of ''nearness'' as a binary relation, semi-proximity spaces (sp-spaces) are defined. The restrictions on semi-proximity spaces are weaker than on topological proximity spaces. Thus, semi-proximity spaces generalize classical topological spaces. Moreover, it is possible to describe all digital pictures used in computer vision and computer graphics as non-trivial semi-proximity spaces. which is not possible in classical topology. Therefore, we use semi-proximity spaces to establish a formal relationship between the ''topological'' concepts of digital image processing and their continuous counterparts in @?^n. Especially interesting are continuous functions in semi-proximity spaces which are called ''semi-proximity'' continuous functions. They can be used for characterizing well-behaved operations on digital images such as thinning. It will be shown that the deletion of a simple point can be treated as a semi-proximity continuous function. These properties and the fact that a variety of nearness relations can be defined on digital pictures indicate that semi-proximity continuous functions are a useful tool in the difficult task of shape description.