智能聚类算法在图像处理中的应用

Lu Rui
{"title":"智能聚类算法在图像处理中的应用","authors":"Lu Rui","doi":"10.1109/TOCS50858.2020.9339705","DOIUrl":null,"url":null,"abstract":"In order to solve the limitation of traditional K-means algorithm in dealing with large-scale data, a fast approximate k-means algorithm (FAKM) is proposed based on the approximate k-means algorithm (AKM) and the idea of classifying the cluster centers. The algorithm omits the cluster centers which only obtain a few samples in the AKM clustering results, and makes full use of the cluster centers with dense and stable samples in the cluster, In the iterative process, the number of samples and categories to be clustered is gradually reduced, which improves the speed of the algorithm and simplifies the clustering results. The FAKM algorithm is applied to the actual image retrieval system, and the experimental results show that the retrieval accuracy, retrieval time and clustering time of the system are greatly improved","PeriodicalId":373862,"journal":{"name":"2020 IEEE Conference on Telecommunications, Optics and Computer Science (TOCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Application of Intelligent Clustering Algorithm in Image Processing\",\"authors\":\"Lu Rui\",\"doi\":\"10.1109/TOCS50858.2020.9339705\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to solve the limitation of traditional K-means algorithm in dealing with large-scale data, a fast approximate k-means algorithm (FAKM) is proposed based on the approximate k-means algorithm (AKM) and the idea of classifying the cluster centers. The algorithm omits the cluster centers which only obtain a few samples in the AKM clustering results, and makes full use of the cluster centers with dense and stable samples in the cluster, In the iterative process, the number of samples and categories to be clustered is gradually reduced, which improves the speed of the algorithm and simplifies the clustering results. The FAKM algorithm is applied to the actual image retrieval system, and the experimental results show that the retrieval accuracy, retrieval time and clustering time of the system are greatly improved\",\"PeriodicalId\":373862,\"journal\":{\"name\":\"2020 IEEE Conference on Telecommunications, Optics and Computer Science (TOCS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Conference on Telecommunications, Optics and Computer Science (TOCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TOCS50858.2020.9339705\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Conference on Telecommunications, Optics and Computer Science (TOCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TOCS50858.2020.9339705","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了解决传统K-means算法在处理大规模数据时的局限性,基于近似K-means算法和聚类中心分类的思想,提出了一种快速近似K-means算法(FAKM)。该算法省略了在AKM聚类结果中只获得少量样本的聚类中心,充分利用了聚类中样本密集且稳定的聚类中心,在迭代过程中,逐渐减少了待聚类的样本和类别数量,提高了算法的速度,简化了聚类结果。将FAKM算法应用到实际的图像检索系统中,实验结果表明,系统的检索精度、检索时间和聚类时间均有较大提高
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Application of Intelligent Clustering Algorithm in Image Processing
In order to solve the limitation of traditional K-means algorithm in dealing with large-scale data, a fast approximate k-means algorithm (FAKM) is proposed based on the approximate k-means algorithm (AKM) and the idea of classifying the cluster centers. The algorithm omits the cluster centers which only obtain a few samples in the AKM clustering results, and makes full use of the cluster centers with dense and stable samples in the cluster, In the iterative process, the number of samples and categories to be clustered is gradually reduced, which improves the speed of the algorithm and simplifies the clustering results. The FAKM algorithm is applied to the actual image retrieval system, and the experimental results show that the retrieval accuracy, retrieval time and clustering time of the system are greatly improved
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on Fault Diagnosis Method of Power Grid Based on Artificial Intelligence Research on Digital Oil Painting Based on Digital Image Processing Technology Effect of adding seed nuclei on acoustic agglomeration efficiency of natural fog An overview of biological data generation using generative adversarial networks Application of Intelligent Safety Supervision Based on Artificial Intelligence Technology
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1