Mathematical morphology is a geometric approach in image processing and analysis with a strong mathematical f!avor. Originally, it was developed as a powerful tool for shape analysis in binary and, later, grey-scale images. But it was soon recognized that the underlying ideas could be extended naturally to a much wider class of mathematical objects, namely complete lattices. This paper presents, in a bird's eye view, the foundations of mathematical morphology, or more precisely, the theory of morphological operators on complete lattices.shape processing and analysis known as mathematical morphology. Mathematical morp~ology was enriched and subsequently popularized by the highly inspiring book Image Analysis and Mathematical Morphology by Jean Serra [24]. Today, mathematical morphology is considered to be a powerful tool for image analysis, in particular for those applications where geometric aspects are relevant. The main idea is to analyze the shape of objects in an image by "probing" the image with a small geometric template (e.g., line segment, disc, square) known as the struc~uring element. The choice of the appropriate structuring element strongly depends on the particular application at hand. This however should not be viewed as a limitation, since it usually leads to additional flexibility in algorithm design. The reader will find several examples of this flexibility in this paper, as well as in the various other contributions to this special issue.
Morphological Image Operators
IntroductionThe basic problem in mathematical morphology is to design nonlinear operators that extract relevant topological or geometric information from images. This requires development of a mathematical model for images and a rigorous theory that describes fundamental properties of the desirable image operators. For example, let us consider the case of binary (black and white) images. Binary images can be mathematically modeled as subsets of a given space E, which, depending on the application at hand, is assumed to possess some additional structure (topological space, metric space, graph, etc.). Thus, the family of binary images is given by P(E), the subsets of E. In this paper, we set E = JRd, the d-dimensional Euclidean space, in which case X is a continuous binary image, or E = zd, the d-dimensional discrete space, in which case X is a discrete binary image. Fundamental relationships between binary images can be mathematically specified by means of set inclusions, unions, or intersections. For example, the fact that image X is hidden by another image Y can be modeled by set inclusion: X ~ Y. If we simultaneously consider two images X, Y, then what we see is their union XUY. The part of an image Y which is not covered by some other image X is their set difference Y\X = Y n xc, where xc denotes the set complement of X, also called the background of X. Some major references in the area of mathematical morphology are [3][4][5][6]8,10,[16][17][18][19][20][22][23][24][25][31][32][33][34].
Complete latticesThe previous discussion c...