2. ABSTRCT
Introduction
Set Theory Concepts
Structuring Elements , Hits or fits
Dilation And Erosion
Opening And Closing
Hit-or-Miss Transformation
Basic Morphological Algorithms
Implementation
Conclusion
3. Introduction
Morphological – Shape , form , Structure
►Extracting and Describing image component
regions
►Usually applied to binary images
►Based on set Theory
4. Set Theory
BASICS:
If A and B are two sets then
UNION = AUB
INTERSECTION = A∩B
COMPLIMENT = (A)c
DIFFERENCE = A-B
5. BASIC LOGIC OPERATIONS :
A B A AND B
A.B
A OR B
A+B
NOT(A)
−
푨
0 0 0 0 1
0 1 0 1 1
1 0 0 1 0
1 1 1 1 0
7. Structuring Elements
Structuring elements can be any size
Structuring make any shape
1 1 1
1 1 1
1 1 1
0 0 1 0 0
0 1 1 1 0
1 1 1 1 1
0 1 1 1 0
0 0 1 0 0
0 1 0
1 1 1
0 1 0
Rectangular structuring elements with their origin at the middle
pixel
8. Hits And Fits
Hit: Any on pixel in the
structuring element
covers an on pixel in the
image
B
A
C
Fit: All on pixels in the
structuring element cover
on pixels in the image
Structuring Element
10. Dilation
Dilation of image f by structuring element s is given
by f s
The structuring element s is positioned with its origin
at (x, y) and the new pixel value is determined using
the rule:
1 if hits
0 otherwise
( , )
s f
g x y
13. Erosion
Erosion of image f by structuring element s is given
by f s
The structuring element s is positioned with its
origin at (x, y) and the new pixel value is determined
using the rule:
1 if fits
0 otherwise
( , )
s f
g x y
16. Erosion v/s Dilation
Erosion
removal of structures of
certain shape and size,
given by SE
Erosion can split apart
Dilation
joined objects and strip
away extrusions
filling of holes of
certain shape and
size, given by SE
can repair breaks
and intrusions
17. Opening And Closing
can be performed by performing combinations of
erosions and dilations
Combine to
keep general shape but
smooth with respect to
Opening object
Closing background
18. Opening
Erosion followed by dilation
denoted by ∘
A B (AB) B
24. Opening V/S Closing
Opening
AB is a subset
(subimage) of A
If C is a subset of D,
then C B is a subset
of D B
(A B) B = A B
Closing
A is a subset
(subimage) of AB
If C is a subset of D,
then C B is a subset
of D B
(A B) B = A B
Note: repeated openings/closings has no effect!
25. Hit or Miss Transformation
Useful to identify specified configuration of pixels,
such as, isolated foreground pixels or pixels at end
of lines (end points)
A*B (AB1)(AB2)
27. Erosion of A complement
And B2
Intersection of eroded images
28. Morphological Algorithms
Using the simple technique we have
looked at so far we can begin to consider
some more interesting morphological
algorithms
We will look at:
Boundary extraction
29. Boundary Extraction
Extracting the boundary (or outline) of an object
is often extremely useful
The boundary can be given simply as
β(A) = A – (AB)
31. Example
A simple image and the result of
performing boundary extraction using a
square structuring element
Original Image Extracted Boundary
32. 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.