Shape automatic clustering-based multi-objective optimization with decomposition

In this paper, a new shape automatic clustering method based on multi-objective optimization with decomposition (MOEA/D-SAC) is proposed, which aims to find the final cluster number k as well as an optimal clustering result for the shape datasets. Firstly, an improved shape descriptor based on the shape context is proposed to measure the distance between shapes. Secondly, the diffusion process is applied to transform the similarity distance matrix among total shapes of a dataset into a weighted graph, where the shapes and their distance are regarded as nodes and weight of edges, respectively. Thirdly, a new clustering method called “the soft clustering” is devised, starting with constructing an adjacency graph which can maintain the edges with the weights of k-nearest-neighbor nodes. Then, a multi-objective evolutionary algorithm with decomposition (MOEA/D) is applied to achieve automatic graph clustering scheme. The proposed clustering algorithm has been used to cluster several shape datasets, including four kimia datasets and a well-known MPEG-7 dataset, and experimental results show that the proposed method can demonstrate competitive clustering results.

[1]  Adrian E. Raftery,et al.  How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis , 1998, Comput. J..

[2]  Philip N. Klein,et al.  Recognition of shapes by editing their shock graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Chun-Wei Tsai,et al.  A modified multiobjective EA-based clustering algorithm with automatic determination of the number of clusters , 2012, 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[4]  Horst Bischof,et al.  Diffusion Processes for Retrieval Revisited , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[5]  Swagatam Das,et al.  Automatic Clustering Using an Improved Differential Evolution Algorithm , 2007 .

[6]  Anuj Srivastava,et al.  Statistical shape analysis: clustering, learning, and testing , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  H. Blum Biological shape and visual science (part I) , 1973 .

[8]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[9]  Joshua D. Knowles,et al.  An Evolutionary Approach to Multiobjective Clustering , 2007, IEEE Transactions on Evolutionary Computation.

[10]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[11]  Zhuowen Tu,et al.  Learning Context-Sensitive Shape Similarity by Graph Transduction , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Y. Q. Liu,et al.  An improved Dijkstra's shortest path algorithm for sparse network , 2007, Appl. Math. Comput..

[13]  Aykut Erdem,et al.  A Game Theoretic Approach to Learning Shape Categories and Contextual Similarities , 2010, SSPR/SPR.

[14]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[15]  Peter Kontschieder,et al.  Beyond Pairwise Shape Similarity Analysis , 2009, ACCV.

[16]  Henri Maître,et al.  Kernel MDL to Determine the Number of Clusters , 2007, MLDM.

[17]  H. Blum Biological shape and visual science. I. , 1973, Journal of theoretical biology.

[18]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[19]  Rolf Lakämper,et al.  A Context Dependent Distance Measure for Shape Clustering , 2008, ISVC.

[20]  Longin Jan Latecki,et al.  Locally constrained diffusion process on locally densified distance spaces with applications to shape retrieval , 2009, CVPR.

[21]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[22]  Ujjwal Maulik,et al.  Multiobjective Genetic Algorithm-Based Fuzzy Clustering of Categorical Attributes , 2009, IEEE Transactions on Evolutionary Computation.

[23]  S Boccaletti,et al.  Identification of network modules by optimization of ratio association. , 2006, Chaos.

[24]  Anuj Srivastava,et al.  On Shape of Plane Elastic Curves , 2007, International Journal of Computer Vision.

[25]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[26]  Mohammad Reza Daliri,et al.  Shape and texture clustering: Best estimate for the clusters number , 2009, Image Vis. Comput..

[27]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[28]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[29]  Sinan Kalkan,et al.  Global Binary Patterns: A Novel Shape Descriptor , 2013, MVA.

[30]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

[31]  Longin Jan Latecki,et al.  Balancing Deformability and Discriminability for Shape Matching , 2010, ECCV.

[32]  Hongyuan Wang,et al.  Shape clustering: Common structure discovery , 2013, Pattern Recognit..

[33]  Haibin Ling,et al.  Shape Classification Using the Inner-Distance , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[34]  Longin Jan Latecki,et al.  Path Similarity Skeleton Graph Matching , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.