where $\backslash$sigma $2$

i is the sample variance of the pixels in region Ri$.$ Assume that the method starts

with the upper left pixel and always attempts to grow to a new connected pixel $($assuming eight

neighbors$)$ whose gray level is closest to the average of the gray levels of the current region. For

the grayscale image below, find the first region that will be generated using this algorithm $($grow

from the upper left pixel until H$($R$1)$ is FALSE$).$ Circle this region in the image and compute

the mean and sample variance of the region. For each step in the region growing process, write

down the pixel values in the current region and their mean and variance.

Assume that the sample variance $\backslash$sigma $2$

i of a region Ri is defined by

$\backslash$sigma $2$

i $=1$

N

$$

j

$($Ij $\backslash$mu $)2$

where N is the number of pixels in Ri$,$ Ij are the pixel values in Ri$,$ and $\backslash$mu is the mean of the

pixel values in Ri$.$ The sum is over the pixels in Ri$.$ The gray$-$level image is

$5514109$

$9612108$

$9712126$

$8810911$