IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 5    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 5,May 2012
An Optimal iterative Minimal Spanning tree Clustering Algorithm for images[
Full Text(PDF, )  PP.I003-I008  
S. Senthil and Dr.R.David Chandrakumar
: Euclidean minimum spanning tree, clustering, eccentricity, center hierarchical clustering, sub tree, standard deviation, cluster separation
Limited Spatial resolution, poor contrast, overlapping intensities, noise and intensity in homogeneities variation make the assignment of segmentation of medical images is greatly difficult. In recent days, mathematical algorithm supported automatic segmentation system plays an important role in clustering of imaging. The minimal spanning tree algorithm is capable of detecting clustering with irregular boundaries. In this paper we propose an optimal iterative minimal spanning tree clustering algorithm (OPIMSTCA).At each hierarchical level, it optimizes the number of cluster, from which the proper hierarchical structure of underlying data set can be found. The algorithm uses a new cluster validation criterion based on the geometric property of data partition of the data set in order to find the proper number of clusters at each level. The center and standard deviation of the cluster are computed to find the tightness of the individual clusters. In this paper we compute tightness of clusters, which reflects good measure of the efficacy of clustering. The algorithm works in two phases. The first phase of the algorithm produces sub trees. The second phase creates objective function using optimal number of clusters. The performance of proposed method has been shown with random data and then the new Cluster separation approach to optimal number of clustering. The experimental results demonstrate that our proposed method is a promising technique for effective optimal clusters.
[1].Clark,M.C.,Hall,L.O.,Goldgof,D.B.,Velthuizen,R. Murtagh,F.R.,Silbiger,M.S:- ―Automatic tumorsegmentation using knowledge-based technique‖. IEEE Transactions on Medical Imaging 117,187- 201(1998).

[2].Prim.R. ―Shortest connection networks and some generalization‖, Bell systems technical journal 36:1389- 1401(1957).

[3].Kruskal.J. ―On the Shortest spanning subtree and the travelling salesman problem ―In proceedings of the American Mathematical Society, Pages 48-50(1956).

[4].Nesetril.J, Milkova.E and Nesetrilova.H.otakar boruvka―On minimal Spanning tree problem:‖Translation of both the 1926 papers, comments, history.DMATH‖.Discrete Mathematics, 233(2001).

[5].Karger.D, Klein.P and Tarjan.R ―A randomized linear-time algorithm to find minimum spanning tree‖, Journal of the ACM, 42(2):321- 328(1995).

[6].Fredman.M and Willard.D ―Trans-dichotomous algorithms for minimum spanning trees and shortest paths‖ ,In proceedings of the 31st annual IEEE symposium on Foundations of computer science,pages 719-725(1990).

[7].Gabow.h,Spencer.T and Rarjan.R ,‖Efficient algorithms for finding minimal spanning trees in undirected and directed graphs‖, Combinatorica 6(2):109-122(1986).

[8].Duda.R.O and hart .P.E. ―pattern classification and scene analysis‖ wiley-inter Sceince, New York (1973).

[9].Gonzalez.R.C and wintz.P ―Digital image processing‖, 2nd edn, Addison-wesley., Reading MA (1987).

[10].Xu, Y.Olman.V and Uberbacher.E. ―A segmentation algorithm for noisy images; design and evaluation‖, patt.recogn.lett19, 1213-1224 C (1998).

[11].Xu.y and Uberbacher.E. ―2D image segmentation using minimum spanning trees‖ ,image Vis.comput 15, 47-57(1997).

[12].States.D.JHarris, N.L.and Hunter, ―Computationally efficient cluster representation in molecula Sequence megaclassification‖, Ismb, 1,387-394(1993).

[13].Gower J.C and Ross .G.J.S ―minimum spanning trees and single linkage analysis‖, Appl.stat.18, 54-64(1969).

[14].Aho.A.V, Hopcroff.J.E and Ullman.J.D, ―The Design and Analysis of computer algorithms‖, Addison- wesley, Reading MA (1974).

[15].A.k and Dubes .R. ―Algorithms for clustering Data‖, prentice –hall, New Jersey (1988).

[16].Mirkin.B, ―Mathematical classification and clustering –DIMACS‖, Rutgers University, Piscataway.Nj (1996).

[17].Stefan wuchty and peter .F.Stadler, ―Centers of complex networks‖(2006).

[18].FengLuo,Latifur kahn,Farokh Bastani,T-ling yen and Jizhong zhon, ―A dynamically growing selforganizing tree(DGOST)for hierarchical gene expression profile‖,Bio informatics,Vol20,No 16,PP2605-2617,(2004).

Untitled Page