Introduction Problem statement Objective

Proposed System
Technical Requirement Specification References

Introduction
Image segmentation is an important field of data clustering. The methods of image segmentation are mainly as follows: thresholding, edge detection, clustering and region growing and merging. Image segmentation plays an important role in MRI Brain analysis. By segmenting the brain structure into three parts-- white matter, grey matter, and cerebrospinal fluid according to the

grey values of pixels, the brain can be observed more clearly.

Problem statement
Classification is one of the problems for which ants inspire very interesting heuristics. One of the first works in this field was done by Lumer and Faieta in 1994 [14], where a population of ant-agents moving randomly on a grid was able to carry objects in order to gather them.

The objective of the project work is to propose new framework for MRI Brain Segmentation, based on the AntPart algorithm. The segmentation results in 3 partitions of the brain structure: white matter, gray matter, and cerebrospinal fluid according to the gray values of pixels

Proposed Architecture
Read image Convert image to grey

Read pixel value Di

Calculate similarity between Ci and Di

YES If similar Classify Di into Ci

NO Check for similar D+

If Di and D+ similar NO

YES

Classify Di in same class

Check for D+ in local memory

YES If Di and D+ similar NO Check for D+ in common memory Classify Di in D+ class

YES If Di and D+ similar Classify Di in D+class

NO Create a new class with Di

Update threshold and similarity

Proposed System
In our proposed algorithm we are adapting the work pattern of ants to classify the MRI brain image. There are two kinds of ants: working ants and master ants.

Working ants are in charge of clustering data to a class. At first, the data are all put in the nest, and each working ant moves data to a class. The ant searches in its own memory to find whether there exists a datum similar enough, if so, these two data belongs to the same class, if not ,the common memory will

be searched. If no sufficiently similar data are found in the common memory, and all the objects in this
memory are all dissimilar enough to the carried datum, a new class is created which only contains this datum and the class is put in the memory of the ant and the common memory at the same time. Otherwise, the datum is returned to the nest and the similarity threshold and dissimilarity threshold of

this datum are updated.

Master ants have two roles: their first role is to recalculate the class centers and move the wrong data to the right class .

Proposed System
The clustering process of a datum in our algorithm is: 1) For the datum D to be classified, find the closet class center C in the common memory, if D and C is similar enough, drop D in the class.

2) Else, seek a similar datum D+ in the class found above, if there is one, drop D in the class.
3) Else, do as the original AntPart does.

To calculate the cluster centers we calculate the histogram and then take the peaks of the histogram as the cluster center. To avoid very close cluster centers we keep a threshold for minimum distance between two cluster centers, if the distance of two peaks is less than the threshold, the smaller peak would be abandoned. After finding the peaks, we merge the

centers which are close enough, the closest two ones would be merged first.

Technical Requirement Specification

1.Hardware Requirement specification:
1.Minimum Intel Pentium IV Processor, 2 GB RAM, 20 GB HDD,CD-ROM 2.LAN/ Internet Connection to Server Machine 2.Software Requirement Specification: 1.Operating System: Windows XP with SP2 2.Programming Tool: Matlab 3.IDE: Matlab 2008

References
[1] Lotfi Admane, Karima Benatchba , Mouloud Koudil, Lamri Siad, Said Maziz,AntPart: an algorithm for the unsupervised classification problem using ants, Applied Mathematics

and Computation 180 (2006) 16_28

[2] H.D. Cheng, X.H. Jiang, Y. Sun, J.L. Wang, Color image segmentation: advances and prospects, Pattern Recognition 34 (12) (2001) 22592281. [3] Li Chenling, Zeng Wenhua ,Zhuang Jiahe An Improved AntTree Algorithm for MRI Brain Segmentation. Proceedings of 2008 IEEE International Symposium on IT in Medicine and Education [4] Xin Fang,Weidong Zhao,Xiaochun Yang. Image segmentation based on improved Ant-

Tree algorithm.Computer Application.2008, pp.1240-1243. (in chinese)

[5] Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing (second edition),Electronic Industries Publisher , china,2007.

References
[6] N. Monmarche_, Algorithmes de fourmis artificielles: application a` l _ optimisation et la classification. PhD Thesis, University of Tours,France, 2000. [7] Jiawei Han and Micheline Kamber, Data MiningConcepts and Techniques (second edition), Morgan Kaufmann Publisher, 2006. [8] D. L. Pham and J. L. Prince, An adaptive fuzzy C-means algorithm for image segmentation in the presence of intensity inhomogeneities, Pattern Recognit. Lett, vol. 20,pp. 5768, 1999.

THANK YOU