Immune Programming Applications in Image Segmentation

Immune Programming Applications in Image Segmentation

Xiaojun Bi (Harbin Engineering University, P.R. China)
DOI: 10.4018/978-1-60566-310-4.ch014
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

In fact, image segmentation can be regarded as a constrained optimization problem, and a series of optimization strategies can be used to complete the task of image segmentation. Traditional evolutionary algorithm represented by Genetic Algorithm is an efficient approach for image segmentation, but in the practical application, there are many problems such as the slow convergence speed of evolutionary algorithm and premature convergence, which have greatly constrained the application. The goal of introducing immunity into the existing intelligent algorithms is to utilize some characteristics and knowledge in the pending problems for restraining the degenerative phenomena during evolution so as to improve the algorithmic efficiency. Theoretical analysis and experimental results show that immune programming outperforms the existing optimization algorithms in global convergence speed and is conducive to alleviating the degeneration phenomenon. Theoretical analysis and experimental results show that immune programming has better global optimization and outperforms the existing optimization algorithms in alleviating the degeneration phenomenon. It is a feasible and effective method of image segmentation.
Chapter Preview
Top

Introduction

Based on the research of the characteristics mechanism of Artificial Immune System (AIS), the feasibility of applying Immune Programming (IP) into the digital image processing is further discussed. The IP mechanism is successfully used into image segmentation, and the image threshold segmentation algorithm based on the maximum information entropy theory and the image segmentation algorithm based on the expense function minimization are proposed in this paper, At the same time give out definite algorithm design and operation steps. We also do simulation experiment both on image threshold segmentation based on the maximum entropy theory and image segmentation based on cost function minimization, and compare them with classical genetic algorithm, analysis and summarize the segmentation result and experiment data. (Figure 1)

Figure 1.

The results of the maximum entropy threshold segmentation based on immune programming and quantification gray-level histogram

The structure of the chapter is organized as follows: Backgrounds and Previous Research Work provides a detailed review and a background of the existing methods of image segmentation, as well as the main challenges for these methods and the advantages of IP. The Main Thrust of the Chapter consists of two parts: firstly, the image threshold segmentation based on the maximum entropy theory is introduced, and the advantages and disadvantages of this method are demonstrated by several groups experiment; in the second part, the image segmentation based on cost function minimization is introduced, and simulation experiment results is given . Concluding Remarks concludes the whole chapter with the special emphasis on: The IP mechanism is successfully introduced into image segmentation, and the image threshold segmentation algorithm based on the maximum information entropy theory and the image segmentation algorithm based on the expense function minimization are proposed in this paper. This method is fit for not only the images with double-peak-shaped histogram, but also those of complicated-shaped histogram. finally, the future directions are addressed in Future Research Directions. The terms and definitions, as well as an additional reading list, can be found at the end of the chapter.

Top

Backgrounds And Previous Research Work

Image segmentation is a technical process which can divide an image into regions with certain and special characteristics and extract the objectives interested from them. Classic image segmentation is to construct a differential operator that is sensitive to pixel gray-level’s step changing, such as Laplace operator, Roberts gradient operator, Sobel gradient operator, etc.

The speed of edge detection based on operators is high, but the results obtained are always intermittent and incomplete information. And this kind of methods is sensitive to noises, so the influence of edge feature from noises is great. For the image with significant double peak and comparative deep valley-bottom histogram, the acceptable segmentation can be got with traditional evolutionary algorithm quickly. Contrarily for the image without such features, in the complex cases such as the target and background are multi or close gray levels, or the gray histogram is multi-peak or single peak but no main valley-bottom, traditional evolutionary algorithm is easy to get into the local optimum, and can not get acceptable segmentation.

Key Terms in this Chapter

Image Segmentation: Image segmentation is a technical process which can divide an image into regions with certain and special characteristics and extract the objectives interested from them. Classic image segmentation is to construct a differential operator that is sensitive to pixel gray-level’s step changing, such as Laplace operator, Roberts gradient operator, Sobel gradient operator, etc.

Antibody (Ab): Ab is the candidate solutions of the problem to be optimized.

Fitness (affinity): For conventional evolutionary algorithms, ranking and fitness assignment are only based on the information from the objective space.

Expense Function: The expense function of the segmentation image is consisted of the information of region distribution and edge distribution, it is defined as. . Where,is the gray variance of region, is the number of the segmentation regions, so the expense function of the region distribution is the summation of the gray variance of all the regions. And theis the expense function of the edge distribution. At each pixel, is defined as the weighted sums.

Antigen (Ag): Ag is the problem to be optimized.

Immune Programming: Immune Programming (IP) combining immune mechanism and evolution mechanism, is a novel idea of utilizing Artificial Immune System (AIS) into engineering application. As a global optimization algorithm with strong robustness, immune programming absorbs the advantage of genetic algorithm——parallel searching. It can construct immune operator by utilizing local characteristic information. By vaccinating and immune selecting, it can intervene the parallel global searching with certain intensity, and effectively restrain the degenerative phenomena in the existing evolution algorithms.

Diversity: For a population-based GA, diverity is maintianed through the mutation and an adequate population size; obviously, the population size is problem-contingent.

Maximum entropy: Digital image consists of pixels, in which the pixels that are different intensity belong to different regions. Sequentially, different shapes are displayed, while different shapes contains of different entropy. Therefore, image entropy can describe shape. For a image, assume that image intensity is nonnegative, that is , then we define image entropyas follow, ,where,. When an image has the equivalent probability of every intensity, the uncertainty of shape in image will reach its max, that is, the image contains the maximum entropy.

Complete Chapter List

Search this Book:
Reset