Professional Documents
Culture Documents
By Kishore Kulkarni
(Under the Guidance of Dr. Longin Jan Latecki)
1
Outline
Connected Components & Holes Euler Number & its significance For Binary Images For Graphs Analogy between Euler number for graphs & binary images Concavities and Convexities Relation between Euler Number, Concavities & Convexities Euler Number computation for test images. Justification of correctness of algorithm used for computing Euler Number
2
Euler Number
The Euler Number (also called as the connectivity factor) is defined as the difference between connected components and holes. Formally, Euler Number is given by
ncomp
E = ncomp - nihole
i=1
where
ncomp=> number of foreground connected components nihole => number of holes for ith connected component
4
Euler Number
E = 11 4 = 7 E = 5 11 = -6
Every black pixel (1) is represents the vertex of the graph Two neighbouring black pixels (vertices of the graphs) are joined to form an edge
The Euler Number for the binary image and its corresponding graph is the same.
8
11
12
14
15
16
17
18
Proof - Contd.
Euler number for component is given by Ei = 1 nihole where nihole is the number of holes in component i Consider
ncomp i=1 ncomp i=1 ncomp
Ei = (1 - nihole)
= ncomp - nihole
i=1
= Eimage
22
Proof - Contd.
The upstream convexity [ ] -------- (1) 0 1 The upstream concavity [ 1 ] ----------(2) 1 The first pixel with value 1 in the image should be of type (1). Hence this convexity refers to the connected component. Now any 0 1 pixel with the mask [ 1 1 ] can (4) be a Hole (5) be a Background If (1) then we are done..
23
0 0 0 1
Proof - Contd.
If it is a background pixel then we have an extra concavity count. Hence we need to prove that there exists an equivalent convexity to balanced the same. Now if it a background pixel, then the two edges in the 2*2 mask (referring to graphical representation of a binary image) should not form a cycle with any of the previously visited black pixels (otherwise we get a hole). If this is the case there should be a pixel with the 0 0 mask [ ]. Hence we can prove that number of concavities 0 1 exceeding number of holes and convexities exceeding 1 are equal by similar argument. Thus they cancel out. Hence the result.
24