Q1. Consider the two image subsets, S and S in the following figure. With reference to Section 2.5 and assuming that V=1, determine whether these two subsets are (a) 4-adjacent. (b) 8-adjacent. (c) m-adjacent.
S1
S2
0100 0010 0011 0110
0001 0100 0100 1000
Q2. Consider the image segment shown in the figure that follows. As in Section 2.5, let V={0,1} be the set of intensity values used to define adjacency. Compute the lengths between these two points and explain why.
2 2 1 1 (q) 2 2 2 7 2 2 1 (p) 1 0 1 3
b. Repeat but using V={1,2}.
c. Repeat problem Q2 for the distance.
Q3. Consider two points p and q from Q2.
(a) State the condition(s) under which the distance between p and q is equal to the shortest 4-path between these points.
(b) Is this path unique?
Q4. Consider the following sub-image that shows intensities using three bits:
1
1 (q) 3 1 0
6 7 5 2 1 2 (p)
2
5
Sub-Image: Compute the following:
Let V={1,2} be the set of intensity values used to define adjacency.
Compute the shortest path that does not exist between these two points and explain why.
Compute the Euclidean distance between the pixels p and q.
Compute the City block distance between the pixels p and q.