{"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}
引用次数: 0
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