10.37Refer to the intensity ramp image in Fig. 10.37(b) and the moving-average algorithm discussed in Section 10.3.7. Assume that the image is of size 500 ×700 pixels and that its minimum and maximum values are 0 and 1, where 0s are contained only in the first column.
FIGURE 10.37 (a) Noisy image. (b) Intensity ramp in the range [0.2, 0.6]. (c) Product of (a) and (b). (d)–(f) Corresponding histograms.
(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 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 n = 2 and b = 1.
(d) Repeat (a) but with n = 100 and b = 1.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.