10.40 Refer to the intensity ramp image in Fig. 10.34(b) and the moving-average algorithm discussed in Section 10.3. Assume that the image is of size 500 x 700 pixels and that its minimum and maxi- mum values are 0 and 1, where I's are contained only in the first column. (a) What would be the result of segmenting this image with the moving-average algorithm using b= 0 and an arbitrary value for n. Explain what the segmented image would look like. (b) Now reverse the direction of the ramp so that its leftmost value is 1 and the rightmost value is 0 and repeat (a). (c) Repeat (a) but with b = 1 and n = 2. (d) Repeat (a) but with b = 1 and n = 100. 10.40 Refer to the intensity ramp image in Fig. 10.34(b) and the moving-average algorithm discussed in Section 10.3. Assume that the image is of size 500 x 700 pixels and that its minimum and maxi- mum values are 0 and 1, where I's are contained only in the first column. (a) What would be the result of segmenting this image with the moving-average algorithm using b= 0 and an arbitrary value for n. Explain what the segmented image would look like. (b) Now reverse the direction of the ramp so that its leftmost value is 1 and the rightmost value is 0 and repeat (a). (c) Repeat (a) but with b = 1 and n = 2. (d) Repeat (a) but with b = 1 and n = 100