# Mathematical morphology

A branch in digital image processing based on set-theoretical, geometrical and topological concepts, and as such particularly useful for the analysis of geometrical structure in an image. It has been applied in various disciplines, such as mineralogy, medical diagnostics, histology, remote sensing, pattern recognition, computer vision, etc. To a large extent, the current status is due to its founders G. Matheron [a1] and J. Serra [a2], [a3]. The first reference contains a comprehensive discussion on random sets and integral geometry. Actually, it is this probabilistic branch which has made morphology into such a powerful methodology. Other main references are [a4], [a5].

The central idea of mathematical morphology is to examine the geometrical structure of an image by matching it with small patterns at various locations in the image. By varying the size and the shape of the matching patterns, called structuring elements, one can extract useful information about the shape of the different parts of the image and their interrelations. In general, this procedure results in non-linear image operators, some of which will be described briefly below.

Originally, mathematical morphology has been developed for binary images; these can be represented mathematically as sets. The corresponding morphological operators use essentially three ingredients from set theory, namely set intersection, union, complementation. In the Euclidean case, translation is added to these three. Let $E = \mathbf R ^ {d}$( continuous case) or $E = \mathbf Z ^ {d}$( discrete case). Two basic morphological operators are dilation $\delta$ and erosion $\varepsilon$, respectively given by Minkowski addition and subtraction:

$$\delta ( X ) = X \oplus A = \cup _ {a \in A } X _ {a} ,$$

$$\varepsilon ( X ) = X \ominus A = \cap _ {a \in A } X _ {- a } .$$

Here, $X _ {a} = \{ {x + a } : {x \in X } \}$. The set $X$ represents the binary image and $A$ the so-called structuring element. The choice of the structuring element depends on the application at hand.

It is obvious that dilation and erosion define increasing (or monotone) translation-invariant operators on ${\mathcal P} ( E ) = 2 ^ {E}$. Every increasing translation-invariant operator can be written as

$$\psi ( X ) = \cup _ {A \in {\mathcal V} ( \psi ) } X \ominus A = \cap _ {A \in {\mathcal V} ( \psi ) ^ {*} } X \oplus {\check{A} } .$$

Here,

$${\mathcal V} ( \psi ) = \left \{ {A \subseteq E } : {0 \in \psi ( A ) } \right \}$$

is called the kernel of $\psi$, and ${\check{A} } = - A$. Furthermore, $\psi ^ {*}$ denotes the negative operator given by $\psi ^ {*} ( X ) = [ \psi ( X ^ {c} ) ] ^ {c}$, where $X ^ {c}$ is the complement of $X$.

The composition

$$\alpha ( X ) = X \circ A = ( X \ominus A ) \oplus A$$

is an idempotent ( $\alpha ^ {2} = \alpha$), anti-extensive ( $\alpha ( X ) \subseteq X$, for every $X$) operator. Operators with such properties are called openings. Dually, the composition

$$\beta ( X ) = X \circ A = ( X \oplus A ) \ominus A$$

is called a closing; it is idempotent and extensive ( $X \subseteq \beta ( X )$, for every $X$).

Openings and closings are used for many different tasks. First, they can be used for image restoration (e.g., noise filtering). Towards that goal, one generally builds compositions of openings and closings, called alternating sequential filters. Secondly, these operators can be used to compute the so-called pattern spectrum ${ \mathop{\rm PS} } _ {X}$ of an image:

$${ \mathop{\rm PS} } _ {X} ( r,A ) = - { \frac{d}{dr } } { \mathop{\rm area} } ( X \circ rA ) , r \geq 0,$$

$${ \mathop{\rm PS} } _ {X} ( - r,A ) = { \frac{d}{dr } } { \mathop{\rm area} } ( X \circ rA ) , r > 0.$$

Here, $A$ has to be a convex set. This pattern spectrum yields information about shape and/or texture of images: see [a6].

Some other important morphological transformations are the distance transform, the skeleton (or medial axis), geodesic reconstruction, and the hit-or-miss transform. Most of these tools were originally developed for binary images. Later, most of them have been extended for grey-scale images. Nowadays (1996), it is generally accepted that complete lattices constitute a natural theoretical framework for morphological operators (cf. Complete lattice). A comprehensive discussion of this framework is given in [a4].

#### References

 [a1] G. Matheron, "Random sets and integral geometry" , Wiley (1975) [a2] J. Serra, "Image analysis and mathematical morphology" , Acad. Press (1982) [a3] "Image analysis and mathematical morphology. II: theoretical advances" J. Serra (ed.) , Acad. Press (1988) [a4] H.J.A.M. Heijmans, "Morphological image operators" , Acad. Press (1994) [a5] C.R. Giardina, E.R. Dougherty, "Morphological methods in image and signal processing" , Prentice-Hall (1988) [a6] P. Maragos, "Pattern spectrum and multiscale shape representation" IEEE Trans. Pattern Analysis and Machine Intelligence , 11 (1989) pp. 701–716
How to Cite This Entry:
Mathematical morphology. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Mathematical_morphology&oldid=47787
This article was adapted from an original article by H.J.A.M. Heijmans (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article