{"title":"基于k-媒质的宫颈癌图像分水岭改进算法","authors":"Bin Dong, Linan Jia, Yuntao Wang, Jianqun Li, Guojie Yang","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00060","DOIUrl":null,"url":null,"abstract":"The watershed algorithm is widely used in the field of the image segmentation, which can overcome the difficulty of image analysis caused by cell overlap. However, the result of the image segmentation with the watershed algorithm were often over-segmentated. To solve this problem, the k-medoids clustering algorithm was introduced to simplify the gradient image, which is preprocessed from the original image. The edge information of the original image was obtained by the Canny edge detection operator, and the target region template was calculated by the optimized initial segmentation. Then, the segmentation result was obtained. The improved algorithm was evaluated by the segmentation accuracy compared with the professional segmented pathology image. The results show that the improved watershed algorithm proposed in this paper has a specific advantage in alleviating the phenomenon of over-segmentation, and the target area appears more completely.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Improved Watershed Algorithm Based on k-Medoids in Cervical Cancer Images\",\"authors\":\"Bin Dong, Linan Jia, Yuntao Wang, Jianqun Li, Guojie Yang\",\"doi\":\"10.1109/IUCC/DSCI/SmartCNS.2019.00060\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The watershed algorithm is widely used in the field of the image segmentation, which can overcome the difficulty of image analysis caused by cell overlap. However, the result of the image segmentation with the watershed algorithm were often over-segmentated. To solve this problem, the k-medoids clustering algorithm was introduced to simplify the gradient image, which is preprocessed from the original image. The edge information of the original image was obtained by the Canny edge detection operator, and the target region template was calculated by the optimized initial segmentation. Then, the segmentation result was obtained. The improved algorithm was evaluated by the segmentation accuracy compared with the professional segmented pathology image. The results show that the improved watershed algorithm proposed in this paper has a specific advantage in alleviating the phenomenon of over-segmentation, and the target area appears more completely.\",\"PeriodicalId\":410905,\"journal\":{\"name\":\"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00060\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00060","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

分水岭算法在图像分割领域得到了广泛的应用,它可以克服细胞重叠给图像分析带来的困难。然而,分水岭算法的图像分割结果往往存在过度分割的问题。为了解决这一问题,引入k-medoids聚类算法,对原始图像进行预处理后的梯度图像进行简化。通过Canny边缘检测算子获取原始图像的边缘信息,通过优化后的初始分割计算目标区域模板。然后,得到分割结果。将改进算法与专业病理图像的分割精度进行比较。结果表明,本文提出的改进分水岭算法在缓解过分割现象方面具有特定优势,目标区域显得更加完整。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Improved Watershed Algorithm Based on k-Medoids in Cervical Cancer Images
The watershed algorithm is widely used in the field of the image segmentation, which can overcome the difficulty of image analysis caused by cell overlap. However, the result of the image segmentation with the watershed algorithm were often over-segmentated. To solve this problem, the k-medoids clustering algorithm was introduced to simplify the gradient image, which is preprocessed from the original image. The edge information of the original image was obtained by the Canny edge detection operator, and the target region template was calculated by the optimized initial segmentation. Then, the segmentation result was obtained. The improved algorithm was evaluated by the segmentation accuracy compared with the professional segmented pathology image. The results show that the improved watershed algorithm proposed in this paper has a specific advantage in alleviating the phenomenon of over-segmentation, and the target area appears more completely.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the RTWC 2019 Workshop Chairs Message from the NGDN 2019 Workshop Chairs Ideation Support System with Personalized Knowledge Level Prediction Message from the DSCI 2019 General Chairs Connection Degree Cost and Reward Based Algorithm in Cognitive Radio Networks
×
引用
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