A New Line Symmetry Distance and Its Application to Data Clustering

被引:0
作者
Sriparna Saha
Sanghamitra Bandyopadhyay
机构
[1] Indian Statistical Institute,Machine Intelligence Unit
来源
Journal of Computer Science and Technology | 2009年 / 24卷
关键词
unsupervised classification; clustering; symmetry property; line-symmetry-based distance; d-tree; genetic algorithm; face recognition;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, at first a new line-symmetry-based distance is proposed. The properties of the proposed distance are then elaborately described. Kd-tree-based nearest neighbor search is used to reduce the complexity of computing the proposed line-symmetry-based distance. Thereafter an evolutionary clustering technique is developed that uses the new line-symmetry-based distance measure for assigning points to different clusters. Adaptive mutation and crossover probabilities are used to accelerate the proposed clustering technique. The proposed GA with line-symmetry-distance-based (GALSD) clustering technique is able to detect any type of clusters, irrespective of their geometrical shape and overlapping nature, as long as they possess the characteristics of line symmetry. GALSD is compared with the existing well-known K-means clustering algorithm and a newly developed genetic point-symmetry-distance-based clustering technique (GAPS) for three artificial and two real-life data sets. The efficacy of the proposed line-symmetry-based distance is then shown in recognizing human face from a given image.
引用
收藏
页码:544 / 556
页数:12
相关论文
共 59 条
  • [1] Jain AK(1999)Data clustering A review ACM Computing Surveys 31 264-323
  • [2] Murthy MN(2001)Stochastic Pattern Recognition Letters 22 603-610
  • [3] Flynn PJ(2002)-means algorithm for vector quantization IEEE Transaction on Pattern Analysis and Machine Intelligence 24 881-892
  • [4] Kov̈esi B(2003)An efficient Pattern Recognition 36 451-461
  • [5] Boucher JM(2005)-means clustering algorithm: Analysis and implementation IEEE Transactions on Pattern Analysis and Machine Intelligence 27 1856-1865
  • [6] Saoodi S(1992)The global IEEE Transaction on Neural Networks 3 643-662
  • [7] Kanungo T(1992)-means clustering algorithm IEEE Transaction on Neural Networks 3 663-671
  • [8] Mount D(1989)A modified IEEE Transaction on Pattern Analysis and Machine Intelligence 11 773-780
  • [9] Netanyahu NS(1989)-means algorithm for circular invariant clustering Intell Robots Compt Vision VIII 1192 600-611
  • [10] Piatko C(1994)Adaptive fuzzy c-shells clustering and detection of ellipses IEEE Transaction on Pattern Analysis and Machine Intelligence 16 855-861