Future university -Sudan

faculty of Engineering
course: Digital image processing
Presentation about:
Morphological Image Processing
Presented

by

Abdullahi Abdi Ahmed Index:201301013

Supervisor :
Dr: Majid
26/10/2016

Presentation out comes

In this presentation we will talk about
An introduction Morphological Image
Processing
Erosion and dilation
Opening and closing
A morphological filter
The hit or-miss transformation
Basic morphological Alogrithms
Gray scale morphology

Let us start together .

Introduction
Morphology is a branch of biology that
deals with the structure and form of living
beings
Mathematical morphology is used as a tool
for extracting image components that are
useful in the in the representation and
description of shapes such as bounders
and skeleton
The language of Mathematical morphology
is set theory

Set Theory
BASICS:
If A and B are two sets then
UNION
= AUB
INTERSECTION = AB
COMPLIMENT = (A)c
DIFFERENCE = A-B

Logic Operations Involving Binary

Pixels and Images
The principal logic operations used in image
processing
are: AND, OR, NOT (COMPLEMENT).
These operations are functionally complete.
Logic operations are preformed on a pixel by pixel
basis between corresponding pixels (bitwise).
Other important logic operations :
XOR (exclusive OR), NAND (NOT-AND)
Logic operations are just a private case for a
binary set operations, such : AND
Intersection , OR Union,

Dilation
In dilation, a small image called structuring element is
used as a local maximum operator. As the structuring
element is scanned over the image, we compute the
maximal pixel value overlapped by B and replace the
image pixel under the anchor point with that maximal
value.
Structuring
element B

Dilation
contd

Dilation contd...
Dilation gradually enlarges the boundaries of regions of
foreground pixels. Thus areas of foreground regions grow in
size while holes within those regions become smaller.

Dilated grayscale
image

Erosion
Erosion is the converse of dilation. The action of the
erosion operator is equivalent to computing a local
minimum over the area of the kernel. As the kernel is
scanned over the image, we compute the minimal pixel
value overlapped by B and replace the image pixel
under the anchor point with that minimal value.

Erosion
contd

Erosion
contd
Erosion
is the

converse of dilation. The action of the

erosion operator is equivalent to computing a local
minimum over the area of the kernel. As the kernel is
scanned over the image, we compute the minimal pixel
value overlapped by B and replace the image pixel
under the anchor point with that minimal value.

Eroded grayscale
image

Opening
Opening generally smoothens the contour of an object, breaks
narrow isthmuses, and eliminates thin protrusions.
The opening of set A by structuring element B, denoted A B,
is defined as,

Opening geometrical
interpretation

Suppose that we view the structuring element B as a (flat)

"rolling ball." The boundary of A B is then established by
the points in B that reach the farthest into the boundary of A
as B is rolled around the inside of this boundary.

Opening step by step

Closing
Closing also tends to smooth sections of contours but, as
opposed to opening, it generally fuses narrow breaks and long
thin gulfs, eliminates small holes, and fills gaps in the contour.

The closing of set A by structuring element B,

denoted A B, is defined as,

Closing geometrical
interpretation

Closing has a similar geometric interpretation, except that

now we roll B on the outside of the boundary.

Closing step by step

A morphological filter
We have a binary image showing a section of a
fingerprint corrupted by noise. The noise manifests
itself as light elements on a dark background and as
dark elements on the light components of the
fingerprint. The objective is to eliminate the noise and
its effects on the print while distorting it as little as
possible. A morphological filter consisting of opening
followed by closing can be used to accomplish this
objective.

Noisy image

Structuring
element

Use of opening and closing for

morphological filtering

The Hit-or-Miss
Transformation
Basic
tool for shape detection.
Our aim is to find the center of gravity of X in the image.
Here dark is 1.

The Hit-or-Miss
Transformation

Some morphological
algorithms
1. Boundary Extraction

Dilation-Recap

2. Region Filling (Conditional Dilation)

The algorithm terminates at step k if Xk=Xk-1

Now, these two are the

same. Hence, the
algorithm ends.
The final step is to
perform its union with A.

3. Extraction of connected components

9.6 Gray-Scale Images

In gray scale images on the contrary to binary
images we deal with digital image functions of
the form f(x,y) as an input image and b(x,y) as
a structuring element.
(x,y) are integers from Z*Z that represent a
coordinates in the image.
f(x,y) and b(x,y) are functions that assign gray
level value to each distinct pair of coordinates.
For example the domain of gray values can be
0-255, whereas 0 is black, 255- is white.

9.6 Gray-Scale Images

Continue
It has
dilation
Erosion
opening
and closing

Conclusion
Morphology is powerful set of tools for
extracting features in an image
We implement algorithms like Thinning
thickening Skeletons etc. various purpose

of image processing activities like

semantation.

References

Digital Image Processing Third Edition Rafael C.

Gonzalez and Richard E. Woods
http://www.uio.no/studier/emner/matnat/ifi/INF4300/h11/un
dervisningsmateriale/morfologi2011.pdf
http://www.slideshare.net/search/slideshow?searchfrom=
header&q=morphological+image+processing

Thank You
Any question.