<p> CIS – 581 : Computer Graphics and Image processing Solutions for Test 2</p><p>Name: siddu Email:[email protected]</p><p>1. Compute the histogram with 3 equally spaced bins for the following image, i.e., define the bins and tell how many pixels contribute to each bin.</p><p>1 2 1 5 1 1 1 1 5 1 1 2 1 5 1 3 4 5 6 7</p><p>Solution:</p><p>Let us define the 3 equal bins as A, B & C Bin A holds the values 0, 1, 2 Bin B holds the values 3, 4, 5 Bin C holds the values 6, 7, 8</p><p>12 10 8 6 Bins 4 2 0 A B C</p><p>Number of Pixels in the bin: Bin A – 12 Pixels Bin B – 6 Pixels Bin C – 2 Pixels 2. Describe 8-connected component labeling algorithm</p><p>Solution :</p><p>The connected components labeling operator scans the image by moving along a row until it comes to a point S . (S denotes the pixel to be labeled at any stage in the scanning process) for which V={1}.</p><p>M P Q</p><p>R S</p><p>When this is true, it examines the four neighbors of S which have already been encountered in the scan (i.e. the neighbors (i) to the left of S, R (ii) above it, P and (iii and iv) the two upper diagonal terms, M & Q). Based on this information, the labeling of S occurs as follows:  If all four neighbors are 0, assign a new label to S, else  if only one neighbor has V={1}, assign its label to S, else  if one or more of the neighbors have V={1}, assign one of the labels to S and make a note of the equivalences. After completing the scan, the equivalent label pairs are sorted into equivalence classes and a unique label is assigned to each class. As a final step, a second scan is made through the image, during which each label is replaced by the label assigned to its equivalence classes</p>