首页> 外文会议>China academic conference on printing, packaging engineering media technology >A New Parallel Hierarchical K-Means Clustering Algorithm for Video Retrieval
【24h】

A New Parallel Hierarchical K-Means Clustering Algorithm for Video Retrieval

机译:用于视频检索的新并行分层k均值聚类算法

获取原文

摘要

The K-means clustering algorithm has been widely adopted to build vocabulary in image retrieval. But, the speed and accuracy of K-means still need to be improved. In the manuscript, we propose a New Parallel Hierarchical K-means Clustering (PHKM) Algorithm for Video Retrieval. The PHKM algorithm improves on the K-means as the following ways. First, the Hellinger kernel is used to replace the Euclidean kernel, which improves the accuracy. Second, the multi-core processors based parallel clustering algorithm is proposed. The experiment results show that the proposed PHKM algorithm is very faster and effective than K-means.
机译:K-means聚类算法已被广泛采用以在图像检索中构建词汇。但是,K-meast的速度和准确性仍然需要得到改善。在稿件中,我们提出了一种新的并行分层K-means聚类(PHKM)算法用于视频检索。 PHKM算法改进了K-Meanse作为以下方式。首先,Hellinger内核用于取代欧几里德内核,这提高了精度。其次,提出了基于基于多核处理器的并行聚类算法。实验结果表明,所提出的PHKM算法比K-Means更快和有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号