Lecture-3
Lecture-3
ü Neighbors of a Pixel A pixel p at coordinates (x, y) has four horizontal and vertical neighbors
4-neighbours of p, whose coordinates are given by
N 4 ( p) = ( x + 1, y ), ( x - 1, y ) , ( x, y + 1) , ( x, y - 1)
ü The four diagonal neighbors of p have coordinates N D ( p)
ü Let V be the set of gray-level values used to define adjacency. In a binary image, V={1} if we
are referring to adjacency of pixels with value 1.
ü 4-adjacency
ü Two pixels p and q with values from V are 4-adjacent if q is in the set N4(p).
ü 8-adjacency.
ü Two pixels p and q with values from V are 8-adjacent if q is in the set N8(p).
ü m-adjacency (mixed adjacency). Two pixels p and q with values from V are m-adjacent if
ü (i) q is in N4(p), or
ü (ii) q is in ND(p) and N 4( p) Ç N 4(q) the set has no pixels whose values are from V
Adjacency, Connectivity, Regions, and Boundaries
Adjacency, Connectivity, Regions, and Boundaries
Adjacency, Connectivity, Regions, and Boundaries
Distance Measures
Distance Measures
Distance Measures
Distance Measures
According to the following intensity values of a 5*5 image, show the paths by drawing dashed lines for
4-adjacency,8-adjacency and m-adjaceny. let V={1,2,3}.
58342
48713
36183
82361
24693
Distance Measures
For a given 6*6 matrix answer the
following questions. Let V={0,1}.
Show the shortest 4-path, 8-path, m-
path between the shaded pixels.
Distance Measures
Compute the Euclidean, city block, m-neighbourhood and chess board distances
between the shaded pixels. Assume all pixels are of 1*1 size.