Professional Documents
Culture Documents
Method:
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
then thin the result with B2 ans so on until
A is thinned with Bn similarly,D is
Thinning: thickened by apply B1,B2……Bn
In thinning the boundary of the object is .
subtracted from the object.
AØB=A∩(A⊗B)C
Thickening:
AʘB=AU(A⊗B)
(AʘB)C=ACØB;
Let B=B1,B2,……Bn
AØB=(((AØB1)ØB2)ØB3)Ø………Bn).
AʘB=(((AʘB1)ʘB2)ʘB3)ʘ………Bn).
Where Ḃ is the image B rotated about the 1) Opening is based on the morphological
origin. operations, erosion and dilation.
Above equation states that when the image 2) Opening smoothest the inside of the
X is dilated by the structuring element B, object contour, brakes narrow strips and
the outcome element Z would be that there eliminates thin portion of the image. It is
will be at least 1 element in B that done by 1st applying erosion and then
intersects in X dilation operations on the image.
Boundary (A) = A - (A Ɵ B)
Region Filling:
Xk=(Xk−1⊗B)∩ACk=1,2,3,….
Therefore X0=p
Now according to formula,
Xk=(Xk−1⊗B)∩ACk=1,2,3,….
X2=(X1⊗B)∩AC
X1=(X0⊗B)∩AC
X5=(X4⊗B)∩AC
Since,X5=X4(Xk=Xk−1.)
Therefore,Xk=X4
The final step is finding the union of
image A and X4
AUXk=A∩X4
i. The segmentation which is carried out examined depending on the type of
based on similarities in the given image is connectivity assumed (4 connectivity or 8
known as region based segmentation. connectivity)
ii. The regions that are formed using this iv. The neighboring pixel is accepted in the
method have the following properties same region as (x1,y1) if they together
satisfy the homogeneity property of a
a. The sum of all the regions is equal to the region. That is, both of them satisfy a
whole image. predefined condition of the region.
(III) Region merging ii. If the grey levels present in the region
do not satisfy the property, we divide the
(IV) Split and merge region into four equal quadrants. If the
property is satisfied, we leave the region as
Each of them is explained below it is.
(I) Region Growing iii. This is done repeatedly, until all the
regions satisfy the given property.
i. The procedure in which pixels are
grouped into larger regions based on some iv. The splitting technique is shown below
predefined conditions is known as region
growing