An accelerated clustering algorithm for segmentation of grayscale images

Sitanshu Gupta, V. Srivatava
{"title":"An accelerated clustering algorithm for segmentation of grayscale images","authors":"Sitanshu Gupta, V. Srivatava","doi":"10.1109/ICCCT.2011.6075210","DOIUrl":null,"url":null,"abstract":"Conventional clustering techniques like FCM, K-Means, Mountain clustering etc. face the main problem of excessive data while dealing with the very big size images. Due to higher order dependency of clustering techniques on the number of data points, time complexity increases excessively while dealing with very large size images. This paper proposes an advanced version of mountain clustering technique, Fast Mountain clustering (FMC), for segmentation of grayscale images whose run time is almost independent of size of image. The proposed approach consists of defining the dataset in another domain which makes the clustering almost independent of size of the data. The obtained results are compared with the widely used techniques like FCM, K-Means, IMC and found out to be better on the basis of cluster validity measures Global silhouette index (GS) and Partition Index (SC).","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCT.2011.6075210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Conventional clustering techniques like FCM, K-Means, Mountain clustering etc. face the main problem of excessive data while dealing with the very big size images. Due to higher order dependency of clustering techniques on the number of data points, time complexity increases excessively while dealing with very large size images. This paper proposes an advanced version of mountain clustering technique, Fast Mountain clustering (FMC), for segmentation of grayscale images whose run time is almost independent of size of image. The proposed approach consists of defining the dataset in another domain which makes the clustering almost independent of size of the data. The obtained results are compared with the widely used techniques like FCM, K-Means, IMC and found out to be better on the basis of cluster validity measures Global silhouette index (GS) and Partition Index (SC).
灰度图像分割的加速聚类算法
传统的聚类技术,如FCM、K-Means、Mountain聚类等,在处理超大尺寸图像时面临着数据过多的主要问题。由于聚类技术对数据点数量的高阶依赖性,在处理超大尺寸图像时,时间复杂度会过度增加。针对运行时间几乎与图像大小无关的灰度图像分割问题,提出了一种改进的山地聚类技术——快速山地聚类(Fast mountain clustering, FMC)。提出的方法包括在另一个域中定义数据集,这使得聚类几乎与数据的大小无关。将所得结果与常用的FCM、K-Means、IMC等方法进行了比较,并在聚类效度测度的基础上,发现全局轮廓指数(Global silhouette index, GS)和分区指数(Partition index, SC)更优。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信