首页> 外文会议>Pattern Recognition >Comparing Clustering Methods for Database Categorization in Image Retrieval
【24h】

Comparing Clustering Methods for Database Categorization in Image Retrieval

机译:图像检索中数据库分类的聚类方法比较

获取原文

摘要

Applying image retrieval techniques to large image databases requires the restriction of search space to provide adequate response time. This restriction can be done by means of clustering techniques to partition the image data set into subspaces of similar elements. In this article several clustering methods and validity indices are examined with regard to image categorization. A subset of the COIL-100 image collection is clustered by different agglomerative hierarchical methods as well as the k-Means, PAM and CLARA clustering algorithms. The validity of the resulting clusters is determined by computing the Davies-Bouldin-Index and Calinski-Harabasz-Index. To evaluate the performance of the different combinations of clustering methods and validity indices with regard to semanti-cally meaningful clusters, the results are compared with a given reference grouping by measuring the Rand-Index.
机译:将图像检索技术应用于大型图像数据库需要限制搜索空间以提供足够的响应时间。可以通过聚类技术将图像数据集划分为相似元素的子空间来完成此限制。在本文中,针对图像分类检查了几种聚类方法和有效性指标。 COIL-100图像集合的子集通过不同的聚集层次方法以及k均值,PAM和CLARA聚类算法进行聚类。通过计算Davies-Bouldin-Index和Calinski-Harabasz-Index确定所得簇的有效性。为了评估针对有意义的聚类的聚类方法和有效性指标的不同组合的性能,可通过测量兰德指数将结果与给定的参考分组进行比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号