.png){kind=icon}
返回
Fast K-means algorithm based on a level histogram for image retrieval
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2013.11.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In image retrieval, the image feature is the main factor determining accuracy; the color feature is the most important feature and is most commonly used with a K-means algorithm. To create a fast K-means algorithm for this study, first a level histogram of statistics for the image database is made. The level histogram is used with the K-means algorithm for clustering data. A fast K-means algorithm not only shortens the length of time spent on training the image database cluster centers, but' it also overcomes the cluster center re-training problem since large numbers of images are continuously added into the database. For the experiment, we use gray and color image database sets for performance comparisons and analyzes, respectively. The results show that the fast K-means algorithm is more effective, faster, and more convenient than the traditional K-means algorithm. Moreover, it overcomes the problem of spending excessive amounts of time on re-training caused by the continuous addition of images to the image database. Selection of initial cluster centers also affects the performance of cluster center training. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
K-means
Histogram
Image retrieval
Color feature
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
分享收藏Integrating wavelets with clustering and indexing for effective content-based image retrieval将小波与聚类和索引相结合，以实现有效的基于内容的图像检索
PREAI
分享收藏
查看更多内容