Modified possibilistic clustering model based on kernel methods

A novel model of fuzzy clustering using kernel methods is proposed. This model is called kernel modified possibilistic c-means （KMPCM） model. The proposed model is an extension of the modified possibilistic c-means （MPCM） algorithm by using kernel methods. Different from MPCM and fuzzy c-means （FCM） model which are based on Euclidean distance, the proposed model is based on kernel-induced distance. Furthermore, with kernel methods the input data can be mapped implicitly into a high-dimensional feature space where the nonlinear pattern now appears linear. It is unnecessary to do calculation in the high-dimensional feature space because the kernel function can do it. Numerical experiments show that KMPCM outperforms FCM and MPCM.

基于快速聚类索引的图像检索系统

为了提高基于内容的图像检索系统的检索速度,提出了一个基于快速聚类索引的图像检索算法,并将其应用于视频新闻检索系统中。该算法采用Fastmap算法实现图像高维特征向量降维,并用改进后的模糊C均值聚类算法对降维后的图像进行聚类,生成图像索引。该算法用于图像检索,检索时间不会随着图像数据库中图像数量、特征向量维数的增加而增加,极大地提高了系统的检索效率,有效地解决了聚类中心初试值的选取问题。同时利用该算法构成的系统还具有动态删除、分裂、合并、插入等功能。实验结果表明,与顺序扫描算法相比,该系统不仅大大提高了检索速度,而且在图像数目和特征向量空间维数增大的条件下,仍能够获得良好的检索性能。

基于聚类的图像检索

如何构建有效的组织和索引、提高图像检索速度是基于内容的图像检索所需解决的关键问题之一。论文采用了一种基于改进的模糊C均值算法的聚类索引。实验表明:该方法应用于图像检索,在准确性和实时性方面均能达到较好的效果,并优于已有的模糊C均值聚类算法。另外,系统实现了基于多特征结合的方法进行检索,并利用基于相关反馈的权重调整方法进一步提高检索性能,使检索结果更加符合用户的视觉效果。