Académique Documents
Professionnel Documents
Culture Documents
Abstract Image segmentation aims to partition an image homogeneity, spatial coherence, connectivity, and so on.
into several disjointed regions that are homogeneous with regards Solution design with consideration of multiple objectives
to some measures so that subsequent higher level computer vision combination is difficult problem, thus creating a gap between
processing, such as object recognition, image understanding and the nature of image segmentation problem and real-world
scene description can be performed. Multi-objective practical solution. Multi-objective nature-inspired clustering
formulations are realistic models for image segmentation because (MoNiC) approach is an appropriate method to bridge this gap
objectives under consideration conflict with each other, and [13, 14].
optimizing a particular solution with respect to a single objective The purpose of this study is to propose a generic design and
can result in unacceptable results with respect to the other
modelling of the MoNiC method for applications of image
objectives. In this paper, we present the current multi-objective
nature-inspired clustering (MoNiC) techniques for image
segmentation. First, we explain how image segmentation is a
segmentation. We are able to diagnose the requirements and problem with multiple objectives. In this section, we identify
issues for modelling this specific technique in the image multiple objectives associated with image segmentation
segmentation problem. Three identified important phases include problem. We elaborate on the characteristics of multi-objective
intelligence, design and choice with respect to the issues of optimization model critical for the image segmentation
clustering problem of image segmentation and multi-objective decisions in Section 3. In Section 4, we describe the current
clustering algorithm design. MoNiC methods that has been applied in image segmentation
problem. At last, the paper presents the modelling and design
Keywordsclustering, image processing, nature-inspired issues of MoNiC in application of image segmentation before
techniques we conclude the survey.
I. INTRODUCTION II. IMAGE SEGMENTATION - A MULTI-OBJECTIVE
Image segmentation has long been an important and OPTIMIZATION PROBLEM
challenging topic in the field of digital image processing. It Image segmentation problem is to decompose a given image
aims to partition an image into several disjointed regions that into segments, or sometimes called regions containing similar
are homogeneous with regards to some measures so that pixels. Example of segments might be regions of the image
subsequent higher level computer vision processing, such as depicting the same object. It is typically defined as an
object recognition, image understanding and scene description exhaustive partitioning of an input image into regions, each of
can be performed [1, 2]. The image segmentation process is which is considered to be homogeneous with respect to some
considered as an essential component of any image analysis image property of interest (e.g., intensity, color, or texture)
system and this problem has received a great deal of attention. [15]. This basic idea, depicted in Figure 1, has been
It is also considered as the most difficult low-level task successfully used for intensity images (with or without
because the segmentation performance needs to be adapted to texture), range (depth) images and multispectral images.
the changes in image quality. It is affected by variations in
environmental conditions, imaging devices, time of day, and (a)
so on [3, 4]. Despite the large number of segmentation
techniques presently available, no general method has been
found that perform adequately across a diverse set of imagery
[3-5].
A new trend of problem formulation for image
segmentation is to use approaches based on multiple Image Image
objectives in its decision making process [6-12]. For problems data Feature Space
with multiple objectives, the objective functions defined are
generally conflicting, preventing simultaneous optimization of Figure 1. Image measurements and positions are transformed to features.
each objective. Many, or even most, real image segmentation Clusters in feature space correspond to image segments
problems actually do have multiple objectives, such as feature
978-1-4244-6502-6/10/$26.00 2010
c IEEE 150
assessment). There are possibilities of multiple sources of
information for a segmentation problem, thus multiple
Image pattern Goal Features for consideration dimensions or multiple representations have to be considered.
- Intensity
In the segmentation process, there is also the favour of
- Colour
Feature selection - Shape combination of multiple methods in getting the appropriate
/extraction - Texture output. With ensemble of multiple methods, there is a
- Spatial tendency of multiple optimizations and decision making
Pattern Feedback
representation loop
processes where multiple validity assessments should be used.
Type of
No. of Data- Type of
nature-
WFA/ PTA Ref objective sets repre-
f2 inspired
functions used* sentation
technique
NSGA-II PTA [9, 31] R Centroid
Figure 3. An example of a problem with two objective functions The Pareto NSGA-II WFA [26] R, M Centroid
front is marked with a bold line PESA-II PTA [28] S Graph
PESA-II WFA [6, 27] N Label
IV. MULTI-OBJECTIVE NATURE-INSPIRED CLUSTERING SPEA-II PTA [29] S Graph
(MONIC) TECHNIQUES Evolutionary
PTA [32] S Graph
method
In order to compare the current applications of MoNiC, Evolutionary M, N,
PTA [33] Centroid
Table 1 provides a brief summary. The applications of these method S
Simulated [7, 20, TWO R, M,
clustering methods have been classified into the two common PTA Centroid
annealing 21] N, S
approaches: WFA or PTA (refer section III). Table 1 also Differential M, N,
shows the type of nature-inspired method used, the number of PTA [8] Centroid
Evolution S
objectives considered, the datasets tested (natural, medical, Differential
PTA [11] R Centroid
remote sensing or simulated images) and the definition of the Evolution
Ant Colony
type of representation methods (centroid-based, graph-based Optimization
PTA [30] N Centroid
or label-based). Immune
PTA [34] N, S Centroid
The common objectives functions used in MO clustering Algorithm
techniques are related to cluster validity measure which NSGA-II PTA [10] M Centroid
usually produces an index value [9, 10, 20, 21]. The role of Particle [12]
THREE
Swam PTA R -
these validity indices is very important in determining the Optimization
appropriate number of clusters presented in a dataset. The * M - Medical, N - Natural, R - Remote Sensing and S - Simulated or Handcrafted
optimization process aims for optimal number of clusters with
optimal clustering output. Among the large number of cluster TABLE II. SOME OF THE POST-PROCESSING METHODS IN MONIC FOR
IMAGE SEGMENTATION PROBLEM
validity indices, the DaviesBouldin (DB) index and Dunns
index are highly used for crisp clustering, whereas, the Xie Method Description
Beni (XB) index is widely used for fuzzy clustering [22]. /index
Gap Gap Statistics uses reference distribution in the process of
Indices used are discussed in detail in Jain and Dubes [23] and statistic estimating the number of clusters. This technique compares
are not discussed further in this paper. However, none of the [28, 32] the within-cluster dispersion with what one might expect
indices perform satisfactorily for wide range of data sets [15, given a reference null distribution.
24]. Most of the clustering validation techniques are biased Adjusted The adjusted Rand index assumes the generalized hyper-
Rand geometric distribution as the model of randomness. It is
towards a clustering criterion [25]. Therefore, optimizing two Index [28] index of choice in many researches as measure of
to three cluster validity functions is important because they agreement between the external criteria and clustering
can complement and compensate one another. results
The optimization/search techniques used in MO techniques Support A support vector machine constructs two hyper-planes (a
Vector generalization of the concept of a plane into a different
are divided into deterministic and stochastic search techniques
Machine number of dimensions) in a high-dimensional space. A
[15]. Deterministic search techniques guarantee an optimal [9] good separation is achieved by the hyper-plane that has the
partition by performing exhaustive enumeration. Meanwhile, largest distance to the nearest training data-points of any
the stochastic search techniques generate a near-optimal class.
partition reasonably quickly, and guarantee convergence to Fuzzy Allows a fuzzy decision between several results of a cluster
voting algorithm. It is done by identifying the points assigned to
optimal partition asymptotically. Most of the nature-inspired technique certain clusters with high fuzzy membership by most of the
search techniques used is related to evolutionary approach, [9] non-dominated solutions.