Professional Documents
Culture Documents
Pi19404
February 25, 2013
Contents
Contents
Image Segmentation - Region Growing Algorithm For UnderWater Image Segmentation 3
0.1 Introduction . . . . . . . . . . . . . . . . . . . . . 0.2 Image Segmentation . . . . . . . . . . . . . . . . 0.3 Region Growing Algorithm . . . . . . . . . . . . . 0.4 4/8 conneced neighbors Recurive Algorithm 0.5 Modification of OverExposed Regions . . . . . 0.6 Using The Edge Map . . . . . . . . . . . . . . . 0.7 Future Work . . . . . . . . . . . . . . . . . . . . . 0.8 Code . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
3 3 3 4 6 6 8 8 9
2|9
3|9
For the present application we assume that we need identify the region in the image to which seed pixels belong ie other region of the image are not required. For every seed points 4/8 connected neighbors of seed point are analyzed for similarity with the seed pixel using some predefined criteria. Thus all the neighborhood pixels are marked to be compared with seed pixel. If the connected neighbor satisfies the criteria then it is included labelled as desired region and neighbor is unmarked. While all the connected neighbors of the present neighbor are marked. This process continues till no marked pixels remains which results in segmentation of region to which seed pixel belongs. As the region grows the similarity comparision can be peformed with the mean value of region rather than just the seed pixels.
4|9
As algorithm progress all connected neighbors of seed pixels are used to initiate recursive calls .If these pixels satisfy the similarity criteria use recurive calls for their connected neighbors and so on. In this way all the connected pixel of seed pixel satisfying the similarity criteria are labelled in the output image and segmentation is achieved. The we can either consider 4/8 connected beighbors for analysis. In the present implementation we use a threshold of 20 . If euclidean distance between two pixels is less than 20 we consider the pixels to be similar. We can see that region growing algorithm stop at places when reflections of object fall on the water.Increasing the threshold is one option to overcome this problem.But it is not guranteed to work in all scenarios.This is shown below. The seed is choosen at location within the shown object. In
(a) Image
(b) thresh 20
(c) thresh 50
(d) input 2
(e) thresh 50
(f) thresh 80
the second image we can see than even with high threshold of 80,the white over exposed region will never be labelled as belonging
5|9
Image Segmentation - Region Growing Algorithm For UnderWater Image Segmentation to the object.
However this modification may not always provide desired sementation as shown in the images below.
6|9
(a) input 2
(b) thresh 80
(c) modified
(d) Image
(e) thresh 20
(f) thresh 50
color and connected to original object. Also we make one more modification of reducing the distance threshold to white pixels keeping it half of color threhold. In the above image the hand along with the object is de-
(a) Image
(b) thresh 20
tected since the color threshold is kept high.But the main point
7|9
Image Segmentation - Region Growing Algorithm For UnderWater Image Segmentation to note is that due to addition of edge map the region does not overflow significantly from the desired object boundary
0.8 Code
The class RegionGrowing defines a generic interface for region growing algorithm. The input to algorithm is input image and seed pixel location and output is labelled image. Code is available in repository https://github.com/pi19404/m19404/tree/master/RegionGrowing
8|9