DOCSLIB.ORG

Digital Topology

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Digital Topology Digital Topology Ulrich Eckhardt Department of Applied Mathematics University of Hamburg Bundesstraße 55 D–20 146 Hamburg, Germany and Longin Latecki Department of Computer Science University of Hamburg Vogt–K¨olln–Straße 30 D–22 527 Hamburg February 26, 2008 To appear in Trends in Pattern Recognition, Council of Scientific Information, Vilayil Gardens, Trivandrum, India. Hamburger Beitr¨agezur Angewandten Mathematik Reihe A, Preprint 89 October 1994 Contents 1 Introduction 1 1.1 Motivation and Scope . 1 1.2 Historical Remarks . 3 2 The Digital Plane 3 2.1 Basic Definitions . 3 2.2 Jordan’s Curve Theorem . 4 2.3 The graphs of 4– and 8–topologies . 6 3 Embedding the Digital Plane 7 3.1 Line Complexes . 7 3.2 Cellular Topology . 11 4 Axiomatic Digital Topology 12 4.1 Definition and Simple Properties . 12 4.2 Connectedness . 14 4.3 Alexandroff Topologies for the Digital Plane . 17 5 Semi–Topology 19 5.1 Motivation . 19 5.2 The Associated Topological Space . 20 5.3 Related Concepts . 21 5.4 Connectedness . 22 5.5 Ordered Sets . 23 6 Applications to Image Processing 24 6.1 Models for Discretization . 24 6.2 Continuity . 24 6.3 Homotopy . 25 6.4 Fuzzy Topology . 25 Abstract to avoid wrong conclusions. For example, if an au- tomatic reasoning system should interpret correctly The aim of this paper is to give an introduction into the sentence “The policemen encircled the house”, it the field of digital topology. This topic of research must be able to understand that it is not possible to arose in connection with image processing. It is im- leave the house without meeting a policeman. Math- portant also in all applications of artificial intelligence ematically speaking, the set of policemen has some dealing with spatial structures. sort of ‘Jordan curve property’ which enables them In this article, a simple but representative model to separate the house from the remainder of the world of the Euclidean plane, called the digital plane, is unless one is able to act in three dimensions. studied. The problem is to introduce a satisfactory It is clear, that no discrete model can exhibit all rel- ‘topology’ for this essentially discrete structure. It evant features of a continuous original. Therefore, one turns out, that all known approaches, which come has to accept compromises. The compromise chosen from different directions of applications and theory, depends on the specific application and the questions converge to virtually one concept of 4/8– or 8/4– which are typical for the application. Digital geome- connectedness. try is an attempt to evaluate the price one has to pay A very natural approach to problems of discrete for discretization. The most simple part of geometry topology is the concept of semi–topological spaces. is topology. The digital model topology necessarily re- flects only certain facets of the underlying continuous structure. It is therefore necessary to apply different 1 Introduction approaches to digital topology. Our visual system seems to be well adapted to cope 1.1 Motivation and Scope with topological properties of the world. For exam- The only sets which can be handled on computers are ple, letters in a document can be classified in a first discrete or digital sets, wich means sets that contain step according to their topological homotopy types. at most a denumerable number of elements. There The layout of documents frequently is based on topo- are two sources for discrete sets logical predicates (e.g., a specific item must appear within a preassigned box). Optical checking of wiring • The data structures of computer science are enu- of chips amounts in finding out whether the wiring merable by definition. So, only discrete objects has the homotopy type wanted. can be represented. This covers a great number There are mainly three approaches for defining a of practical situations. For example in most ap- digital analog of the well–known ‘natural’ topology plications of Artificial Intelligence the universe of the Euclidean space: of discourse is a finite set. Another example is discrete classification e.g. of plants and animals Graph–Theoretic Approach A very elementary or stars into spectral classes etc. structure which can be handled easily on com- puters is a graph. A graph is obtained when a • Continuous objects are discretized, i.e. they are neighborhood relation is introduced into the dig- approximated by discrete objects. This is done ital set. Such a structure allows to investigate e.g. in finite element models in engineering but connectivity of sets. also in image processing where the intrinsically continuous image is represented by a discrete set Imbedding Approach The discrete structure is of ‘pixels’. imbedded into a known continuous structure, usually into an Euclidean space. Topological In some cases the objects under consideration are properties of discrete objects are then defined taken from a space with certain geometric charac- by means of their continuous images. teristics. Any useful discrete model of the situa- tion should model the geometry faithfully in order Axiomatic Approach Certain subsets of the un- 1 derlying digital structure are declared to be • General topology deals mainly with continuous ‘open sets’ and are required to fulfill certain ax- functions. Such functions have no counterparts ioms. These axioms have to be chosen in such in discrete structures. However, it would be use- a way that the digital structure gets properties ful for many applications to have such a concept which are as close as possible to the properties as ‘discrete continuity’. of usual topology. • By means of a suitable definition of continuity All three approaches have advantages and disad- one is able to compare topological structures vantages. The axiomatic approach is mathematically with each other. A very powerful concept in very elegant but it does not directly provide the topology is homeomorphy. Homeomorphic topo- language which is wanted in applications. The ob- logical structures are topologically the same. So, jects which are practically investigated are not open if a topological problem is investigated, one has sets but rather connected sets, sets which are con- to look for a homeomorphic structure in which tained in other sets etc. The graph theoretic approach the problem can be stated and solved as easily yields directly connectedness but is beomes very diffi- as possible. cult to handle more complicated concepts of topology • Homotopy theory deals with properties of sets such as continuity, homotopy etc. The embedding ap- which are invariant under continuous deforma- proach is of course only adequate for structures which tions. Translating homotopy from general topol- can be related to an Euclidean space. The problem is ogy to discrete structures raises a number of that one has to find for each question an appropriate questions which are not yet solved in a satis- embedding. factory way. On the other hand, one of the most There are many proposals in the literature which often used preprocessing methods in image pro- deal with topological questions. Of course, these pro- cessing is thinning which is the numerical real- posals cannot always be characterized by only one of ization of a ‘deformation retract’ from homotopy the approaches given above. theory. We list some of the questions which are typically attacked by digital topology: There are several practical situations other than image processing or spatial reasoning in artificial • Definition of connectedness and connected com- intelligence where topological spaces were used to ponents of a set. model discrete situations, starting from Alexandrov’s • Classification of points in a digital set as interior work in 1935 (see [1, 2]). In these publications, and boundary points, definition of boundaries of Alexandroff provided a theoretical basis for the topol- digital sets. ogy of ‘cell complexes’. • Formulation of Jordan’s Curve Theorem (and • In his book on the lambda calculus, Barendregt its higher dimensional analogs). This theorem uses the Scott topology [10, p. 9 f.] for partially states that a set can be represented by its bound- ordered sets [55], [56]. By means of this topol- ary which leads to a reduction of dimensionality ogy, concepts such as continuity of functions can in the representation. This Theorem is, as men- be introduced. There exist numerous publica- tioned above, essential for understanding spatial tions on application of discrete topologies to data relations and is used for grouping items in spatial structures, abstract computing models, combi- data structures. natorial algorithms, complexity theory and log- ics. • One very important topological ‘invariant’ of a set is its Euler number. This number is in a cer- • By using a suitable topology over the attribute tain sense all what we can get by parallel working set, Baik and Miller attempted to test equiva- machines. lence of heterogeneous relational databases [9]. 2 • Brissaud [12, 13, 14] defined a so–called ‘pre– similar theory was provided in the same time by G. topology’ for modelling preference structures in Herman [23]. economics. (for other applications in economics In 1979 A. Rosenfeld published a paper which had see [4], [5], [6], [7]). the title “Digital Topology” [53]. This paper was very These pre–topological spaces were later used by influential since for the first time some very difficult Arnaud et al. [8] in image processing. problems of digital topology were treated rigorously. The paper was based on results of Duda, Hart and In this paper, only topologies for the 2–dimensional Munson [17]. rectangular grid Z2 are considered. This grid can be understood to be the set of all points of the Euclidean plane R2 having integer coordinates. A more general theory is possible [52] but for easier presentation this is not attempted here. The reader should be familiar with elementary topology of the Euclidean plane.
Load more

Recommended publications
  • 1 1. Introduction Methods of Digital Topology Are Widely Used in Various
    1. Introduction Methods of digital topology are widely used in various image processing operations including topology- preserving thinning, skeletonization, simplification, border and surface tracing and region filling and growing. Usually, transformations of digital objects preserve topological properties. One of the ways to do this is to use simple points, edges and cliques: loosely speaking, a point or an edge of a digital object is called simple if it can be deleted from this object without altering topology. The detection of simple points, edges and cliques is extremely important in image thinning, where a digital image of an object gets reduced to its skeleton with the same topological features. The notion of a simple point was introduced by Rosenfeld [14]. Since then due to its importance, characterizations of simple points in two, three, and four dimensions and algorithms for their detection have been studied in the framework of digital topology by many researchers (see, e.g., [1, 5, 12-13]). Local characterizations of simple points in three dimensions and efficient detection algorithms are particularly essential in such areas as medical image processing [2, 7-8, 15], where the shape correctness is required on the one hand and the image acquisition process is sensitive to the errors produced by the image noise, geometric distortions in the images, subject motion, etc, on the other hand. It has to be noticed that in this paper we use an approach that was developed in [3]. Digital spaces and manifolds are defined axiomatically as specialization graphs with the structure defined by the construction of the nearest neighborhood of every point of the graph.
    [Show full text]
  • Equivalence Between Digital Well-Composedness and Well-Composedness in the Sense of Alexandrov on N-D Cubical Grids Nicolas Boutry, Laurent Najman, Thierry Géraud
    Equivalence between Digital Well-Composedness and Well-Composedness in the Sense of Alexandrov on n-D Cubical Grids Nicolas Boutry, Laurent Najman, Thierry Géraud To cite this version: Nicolas Boutry, Laurent Najman, Thierry Géraud. Equivalence between Digital Well-Composedness and Well-Composedness in the Sense of Alexandrov on n-D Cubical Grids. Journal of Mathematical Imaging and Vision, Springer Verlag, 2020, 62 (9), pp.1285-1333. 10.1007/s10851-020-00988-z. hal- 02990817 HAL Id: hal-02990817 https://hal.archives-ouvertes.fr/hal-02990817 Submitted on 5 Nov 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. JMIV manuscript No. (will be inserted by the editor) Equivalence between Digital Well-Composedness and Well-Composedness in the sense of Alexandrov on n-D Cubical Grids Nicolas Boutry · Laurent Najman · Thierry G´eraud Received: date / Accepted: date Abstract Among the different flavors of well-compo- 1 Introduction sednesses on cubical grids, two of them, called respec- tively digital well-composedness (DWCness) and well- composedness in the sense of Alexandrov (AWCness), are known to be equivalent in 2D and in 3D. The for- mer means that a cubical set does not contain critical configurations when the latter means that the boundary of a cubical set is made of a disjoint union of discrete surfaces.
    [Show full text]
  • Analysis and Structured Representation of the Theory of Abstract Cell Complexes Applied to Digital Topology and Digital Geometry
    Analysis and Structured Representation of the Theory of Abstract Cell Complexes Applied to Digital Topology and Digital Geometry Henrik Schulz 1,SiegfriedFuchs2, and Vladimir Kovalevsky 3 February 2003 1This paper was published as a student thesis by the author at Dresden University of Technology, Department of Computer Science, Dresden, Germany 2Dresden University of Technology, Department of Computer Science, Dresden, Ger- many 3TFH Berlin - University of Applied Sciences, Berlin, Germany Contents 1 Introduction 2 2 Notions and Theorems in Classical and Digital Topology 3 2.1ClassicalTopology............................ 3 2.2DigitalTopology............................. 4 2.3BlockComplexes............................. 8 2.4Skeletons................................. 8 2.5MoreNotionsandProblems....................... 10 3 Manifolds, Balls and Spheres 12 3.1Manifolds................................. 12 3.2CombinatorialTopology......................... 13 3.3 Interlaced Spheres . 14 4 Cartesian Complexes and Digital Geometry 15 4.1LocallyFiniteCartesianSpaces..................... 15 4.2DigitalGeometry............................. 15 4.3PointsandVectors............................ 17 5 Mappings among Locally Finite Spaces 19 6 Structured Representation 20 1 1 Introduction This paper is intended to give an overview of the theory of abstract cell complexes from the viewpoint of digital image processing. We focus on digital topology and digital geometry and try to analyse the theory in a wide variety. In the next four sections we present the
    [Show full text]
  • A Tutorial on Well-Composedness Nicolas Boutry, Thierry Géraud, Laurent Najman
    A Tutorial on Well-Composedness Nicolas Boutry, Thierry Géraud, Laurent Najman To cite this version: Nicolas Boutry, Thierry Géraud, Laurent Najman. A Tutorial on Well-Composedness. Journal of Mathematical Imaging and Vision, Springer Verlag, 2018, 60 (3), pp.443-478. 10.1007/s10851-017- 0769-6. hal-01609892v2 HAL Id: hal-01609892 https://hal.archives-ouvertes.fr/hal-01609892v2 Submitted on 12 Oct 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. JMIV manuscript No. (will be inserted by the editor) A Tutorial on Well-Composedness Nicolas Boutry · Thierry G´eraud · Laurent Najman Received: date / Accepted: date Abstract Due to digitization, usual discrete signals 1 Introduction generally present topological paradoxes, such as the connectivity paradoxes of Rosenfeld. To get rid of those In 1979, Rosenfeld [148] studied basic topological pro- paradoxes, and to restore some topological properties to perties of digital images that he called digital topology. the objects contained in the image, like manifoldness, This work was completed in [90] by Kong and himself. Latecki proposed a new class of images, called well- However, Rosenfeld’s framework needs to use a dual composed images, with no topological issues.
    [Show full text]
  • Digital Geometry, a Survey
    Digital Geometry, a Survey Li Chen David Coeurjolly University of the District of Columbia Université de Lyon, CNRS, LIRIS ABSTRACT used directly. This paper provides an overview of modern digital geometry Image processing and computer graphics are two main and topology through mathematical principles, algorithms, reasons why digital geometry was developed. First, a dig- and measurements. It also covers recent developments in the ital image is stored in a digital array, and the image must applications of digital geometry and topology including im- be processed using some geometric properties of this type age processing, computer vision, and data science. Recent of data|digital arrays. In computer graphics, the internal research strongly showed that digital geometry has made representation of the data is usually in the form of triangu- considerable contributions to modelings and algorithms in lation or meshes. However, when the image is displayed on image segmentation, algorithmic analysis, and BigData an- the screen, it must be digitized since the screen is a digital alytics. array. Two popular examples can provide explanations as to why digital geometry is necessary. First, most image process- Keywords ing and computer vision problems require extracting cer- Digital geometry, Digital topology, image processing tain objects from the image. This process is called image segmentation, and it usually involves separating meaningful objects from the background. Even though the boundary 1. INTRODUCTION TO DIGITAL GEOM- of an object appears to be a continuous curve, it is actually ETRY a sequence of digital points. Identification, measurement, Digital geometry is the study of the geometric properties and extraction are all related to digital geometry.
    [Show full text]