Professional Documents
Culture Documents
edu
to model good clusters. Every partition of the nodes or the segmentation problem for a problem domain.
pixels as output from these algorithms is measured as an This review paper delivers many image segmentation methods
object segment in an image representing a graph. Some of the which we classified into three categories. Traditional
popular algorithms are thresholding, normalized cuts, iterated methods (1), Graph theoretical methods (2) and combination
graph cut, clustering method, watershed transformation, of both the Traditional and Graph theoretical methods (3). We
minimum cut, grey graph cut, and minimum spanning tree- present motivations and descriptions for each category of
based segmentation. methods.
General Terms In section 2, a survey of traditional image segmentation is
Image processing, graph based segmentation. presented, and in section 3, a survey on graph theoretical
approach to image segmentation is presented, and in section 4,
Keywords a survey on combination of traditional and graph based
Image segmentation, histogram, neural network, thresholding, methods of image segmentation is presented. Finally section 5
watershed transformation, clustering, quadtree, graph consists of conclusion about our survey with direction for
theoretical methods, Euler Graph, minimal spanning tree, grey future work.
graph cut, GrabCut.
2. TRADITIONAL IMAGE
1. INTRODUCTION SEGMENTATION METHODS
Image segmentation is a matured research topic, which found Many traditional segmentation techniques are found in
progress around 1970. But still there is no perfect solution in
the direction of it. literature. In the following subsections we present few of
them.
In computer vision, image segmentation is the process of
dividing a digital image into multiple segments (sets of pixels, 2.1 Thresholding
also called as super pixels). The objective of segmentation is It is the simplest technique of all image segmentation
to simplify or modify the representation of an image into methods. This method is constructed on a threshold value,
somewhat that is more significant and easier to analyze used to transform a gray-scale image into a binary image. The
[3].Image segmentation is normally used to trace objects and basic objective of this technique is to select the threshold
boundaries (lines, dots, curves, etc.) that can occur in images. value. Thresholding is one of the broadly used methods for
Specifically, image segmentation is the process of allocating a image segmentation. It is useful in discerning foreground
label to each pixel in an image such that pixels with the same from the background. By selecting suitable threshold value T,
label share some pictorial characteristics. The outcome of the gray level image can be transformed to binary image. The
image segmentation is a set of segments or regions that binary image should contain every important information
together represents the entire image. Every pixel in a region is about the position and shape of the objects of interest
similar with respect to certain characteristic otherwise (foreground). The advantage of gaining first a binary image is
computed property, such as color, texture, intensity etc. to reduce the complexity of the data and simplifies the process
Neighboring regions are meaningfully different with respect of recognition and image classification. The best way to
to the same characteristics [3]. After applying to a stack of convert a gray-level image into a binary image is to select a
images, typically in medical imaging, the consequent contours single threshold value T. Then every gray level values below
this T will be classified as black, and those above the value of
http://www.academia.edu/6627542/A_Survey_on_Traditional_and_Graph_Theoretical_Techniques_for_Image_Segmentation 1/9
18/05/2015 ASurveyonTraditionalandGraphTheoreticalTechniquesforImageSegmentation|BasavaprasadBAcademia.edu
this T will be classified as black, and those above the value of
after image segmentation can be used to create 3D
38
Image segmentation
Gray histogram Gradient Region Fuzzy clustering Neural network Physically based
techni ue basedmethod Thresholding o eratin se mentation based se mentation se mentation
T will be white. The segmentation problem depends on and location of a pixel or a weighted grouping of these
selecting the proper value for the threshold T. A common factors. The parameterK is selected randomly, manually or by
method used to select T is by analyzing the histograms of the a heuristic. This method is positive to converge, but it may not
type of images that is to be segmented. The perfect case is yield the optimum solution. The quality of the solution
when the histogram presents only two dominant modes and a depends on the preliminary set of clusters and also on the
clear valley. In this case the value of T is selected as the valley value of K. The following K-means algorithm is an iterative
point between the two modes. In actual applications method which is used to divide an image into K clusters or
histograms are more complex, with various peaks and not segments. The simple algorithm is:
clear valleys. One disadvantage of the method is that, it is not
1.K cluster centers are picked, manually, randomly or
always easy to select the value of T.
Table 1: Comparison of thresholding methods [28] 2.grounded on some
Allocate each pixelheuristic.
of the image to the cluster which
Segmentation
Method Advantage Disadvantage
effect
Minimum Low Narrow in
Normal
Thresholding Complexity application
Iterative Average Image details
Good
Thresholding Complexity are fuzzy
Entropy based Very low Sensitive to
Normal
Thresholding complexity noise (a) (b)
Combine with
Otsu Very high other algorithms Fig 2: (a) original image and (b) result using
Good
Thresholding complexity to improve its Thresholding technique representing category (1)
performance
minimizes the distance between the pixel and the
2.2 Clustering methods cluster center.
In this method, distance between a pixel of an image and a 3.Compute the cluster centers again by averaging all of
cluster center is used for clustering. The difference is naturally the pixels in the cluster.
based on certain properties such as color, intensity, texture, 4.Repeat the steps 2 and 3 until convergence is attained
(e.g. no pixels change clusters).
39
http://www.academia.edu/6627542/A_Survey_on_Traditional_and_Graph_Theoretical_Techniques_for_Image_Segmentation 2/9
18/05/2015 ASurveyonTraditionalandGraphTheoreticalTechniquesforImageSegmentation|BasavaprasadBAcademia.edu
22222232221222212222 grouping the image into regions. For general image there are
32222321250132123132 two attributes: the object and its background. The object of
22588897777788888232 the image is one grey level which is the smaller peak in the
12988877707668882122 histogram. The background of the image is another grey level
22888892326669893213 which represents the large peak in the histogram. The peaks
21278221222666665222 and valleys of the histogram are used to trace the clusters of
22002222220226660225 the image. Color or intensity can be used as a measure. This
21221231223266622321 technique can be improved by applying the histogram-seeking
32238852223266821222 method recursively to clusters in an image with a purpose to
21288888342288882232 divide them into smaller clusters. This procedure is repeated
22328888899888522121 with smaller and still smaller clusters until no further clusters
are formed [3, 5]. The disadvantage of the histogram-seeking
22123988888889223422
23222278888882022122 technique is that it can be difficult to identify significant peaks
22232323883212123234 and valleys in the image. This method segments an image,
25221212222222222222 based on active objects and a still situation, following in a
22122222320222202102 different type of segmentation which is useful in Video
20222322412212223221 tracking.
22221212222222342222 The histogram in Figure 4 shows us the gray levels of the
21222222221222222142 background and the object. The biggest peak characterizes the
background and the next biggest peak describes the object. A
Fig. 3: An image example threshold point in the valley between the two peaks and
threshold of the image is chosen. Thresholding receipts each
pixel whose value is on the object side of the point and sets it
to one and all others to zero. The histogram peaks and the
valley amongst them are the keys for the image segmentation.
40
http://www.academia.edu/6627542/A_Survey_on_Traditional_and_Graph_Theoretical_Techniques_for_Image_Segmentation 3/9
18/05/2015 ASurveyonTraditionalandGraphTheoreticalTechniquesforImageSegmentation|BasavaprasadBAcademia.edu
NN-based
Image Segmentation techniques
Supervised Unsupervised
Techniques Techniques
Kohonen
Self-Organizing
Maps (SOM)
A distinctive data structure is involved in the implementation growing, noise reduction, and motion detection etc. The
of the algorithm of this method. Its time complexity can reach flowchart of neural network based image segmentation is
O(nlog n), an optimal algorithm of themethod [10, 12]. shown in figure 6.
41
the numberquality
significant of graph edges
of the and is also
technique is itsquick
abilityintopractice.
preserveThe
the
low-variability feature of image regions or segments while
disregarding detail in high-variability segments or regions.
(b)
(c) (d)
(e) (f)
(g) (h)
(i) (j)
Fig 7: (a) Original image. (b) Plots the smallest
eigenvectors of the generalized eigenvalue system.
Subplots (c)-(j) show the eigenvectors corresponding
the second smallest to the ninth smallest eigenvalues of
the system. The eigenvectors are reshaped to be the
size of the image.
42
43
http://www.academia.edu/6627542/A_Survey_on_Traditional_and_Graph_Theoretical_Techniques_for_Image_Segmentation 6/9
18/05/2015 ASurveyonTraditionalandGraphTheoreticalTechniquesforImageSegmentation|BasavaprasadBAcademia.edu
http://www.academia.edu/6627542/A_Survey_on_Traditional_and_Graph_Theoretical_Techniques_for_Image_Segmentation 7/9
18/05/2015 ASurveyonTraditionalandGraphTheoreticalTechniquesforImageSegmentation|BasavaprasadBAcademia.edu
http://www.academia.edu/6627542/A_Survey_on_Traditional_and_Graph_Theoretical_Techniques_for_Image_Segmentation 8/9
18/05/2015 ASurveyonTraditionalandGraphTheoreticalTechniquesforImageSegmentation|BasavaprasadBAcademia.edu
Job Board About Press Blog Stories Terms Privacy Copyright We're Hiring! Help Center
Academia 2015
http://www.academia.edu/6627542/A_Survey_on_Traditional_and_Graph_Theoretical_Techniques_for_Image_Segmentation 9/9