Possibility Theoretic Clustering and its Preliminary Application to Large Image Segmentation

  • Authors:

  • Fu-Lai Chung;Shitong Wang;M. Xu;Dewen Hu;Qing Lin

  • Affiliations:

  • Department of Computing, Hong Kong Polytechnic University, 214122, Hong Kong, JiangSu, China;School of Information Engineering, Southern Yangtze University, 214122, Wuxi, JiangSu, China;School of Information Engineering, Southern Yangtze University, 214122, Wuxi, JiangSu, China;School of Automation, National Defense University of Science and Technology, 214122, Changsha, JiangSu, China;Department of Computer Science and Engineering, Nanjing University of Science and Technology, 214122, Nanjing, JiangSu, China

  • Venue:
  • Soft Computing - A Fusion of Foundations, Methodologies and Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rooted at the exponential possibility model recently developed by Tanaka and his colleagues, a new clustering criterion or concept is introduced and a possibility theoretic clustering algorithm is proposed. The new algorithm is characterized by a novel formulation and is distinctive in determining an appropriate number of clusters for a given dataset while obtaining a quality clustering result. The proposed algorithm can be easily implemented using an alternative minimization iterative procedure and its parameters can be effectively initialized by the Parzen window technique and Yager’s probability–possibility transformation. Our experimental results demonstrate its success in artificial datasets and large image segmentation. In order to reduce the complexity of large image segmentation, we propose to integrate the new clustering algorithm with a biased sampling procedure based on Epanechnikov kernel functions. As demonstrated by the preliminary experimental results, the possibility theoretic clustering is effective in image segmentation and its integration with a biased sampling procedure offers an attractive framework of large image processing.