首页> 外文会议>Computer vision systems >Rek-Means: A k-Means Based Clustering Algorithm
【24h】

Rek-Means: A k-Means Based Clustering Algorithm

机译:Rek-Means:基于k-Means的聚类算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper we present a new clustering method based on k-means that has been implemented on a video surveillance system. Rek-means does not require to specify in advance the number of clusters to search for and is more precise than k-means in clustering data coming from multiple Gaussian distributions with different co-variances, while maintaining real-time performance. Experiments on real and synthetic datasets are presented to measure the effectiveness and the performance of the proposed method.
机译:在本文中,我们提出了一种基于k均值的新聚类方法,该方法已在视频监控系统上实现。 Rek-means不需要预先指定要搜索的聚类数,并且在保持实时性能的同时,在来自多个具有不同协方差的多个高斯分布的聚类数据中比k-means更精确。提出了对真实数据集和合成数据集的实验,以衡量该方法的有效性和性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号