直观模糊c均值算法在MRI分割中的应用

Dong-Chul Park
{"title":"直观模糊c均值算法在MRI分割中的应用","authors":"Dong-Chul Park","doi":"10.1109/ICISA.2010.5480541","DOIUrl":null,"url":null,"abstract":"A new model called intuitive fuzzy c-means (IFCM) model is proposed for the segmentation of magnetic resonance image in this paper. Fuzzy c-means (FCM) is one of the most widely used clustering algorithms and assigns memberships to which are inversely related to the relative distance to the point prototypes that are cluster centers in the FCM model. In order to overcome the problem of outliers in data, several models including possibilistic c-means (PCM) and possibilistic-fuzzy cmeans (PFCM) models have been proposed. In IFCM, a new measurement called intuition level is introduced so that the intuition level helps to alleviate the effect of noise. Several numerical examples are first used for experiments to compare the clustering performance of IFCM with those of FCM, PCM, and PFCM. A practical magnetic resonance image data set is then used for image segmentation experiment. Results show that IFCM compares favorably to several clustering algorithms including the SOM, FCM, CNN, PCM, and PFCM models. Since IFCM produces cluster prototypes less sensitive to outliers and to the selection of involved parameters than the other algorithms, IFCM is a good candidate for data clustering and image segmentation problems.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Intuitive Fuzzy C-Means Algorithm for MRI Segmentation\",\"authors\":\"Dong-Chul Park\",\"doi\":\"10.1109/ICISA.2010.5480541\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new model called intuitive fuzzy c-means (IFCM) model is proposed for the segmentation of magnetic resonance image in this paper. Fuzzy c-means (FCM) is one of the most widely used clustering algorithms and assigns memberships to which are inversely related to the relative distance to the point prototypes that are cluster centers in the FCM model. In order to overcome the problem of outliers in data, several models including possibilistic c-means (PCM) and possibilistic-fuzzy cmeans (PFCM) models have been proposed. In IFCM, a new measurement called intuition level is introduced so that the intuition level helps to alleviate the effect of noise. Several numerical examples are first used for experiments to compare the clustering performance of IFCM with those of FCM, PCM, and PFCM. A practical magnetic resonance image data set is then used for image segmentation experiment. Results show that IFCM compares favorably to several clustering algorithms including the SOM, FCM, CNN, PCM, and PFCM models. Since IFCM produces cluster prototypes less sensitive to outliers and to the selection of involved parameters than the other algorithms, IFCM is a good candidate for data clustering and image segmentation problems.\",\"PeriodicalId\":313762,\"journal\":{\"name\":\"2010 International Conference on Information Science and Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Information Science and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISA.2010.5480541\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Information Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISA.2010.5480541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

本文提出了一种新的磁共振图像分割模型——直观模糊c均值模型。模糊c均值(FCM)是应用最广泛的聚类算法之一,其分配的隶属度与FCM模型中作为聚类中心的点原型的相对距离成反比。为了克服数据中的异常值问题,提出了几种模型,包括可能性c均值(PCM)模型和可能性-模糊均值(PFCM)模型。在IFCM中,引入了一种称为直觉电平的新测量方法,以便直觉电平有助于减轻噪声的影响。首先用几个数值算例进行了实验,比较了IFCM与FCM、PCM和PFCM的聚类性能。然后利用一个实际的磁共振图像数据集进行图像分割实验。结果表明,IFCM优于SOM、FCM、CNN、PCM和PFCM模型等几种聚类算法。由于IFCM产生的聚类原型对异常值和所涉及参数的选择的敏感性低于其他算法,因此IFCM是数据聚类和图像分割问题的良好候选。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Intuitive Fuzzy C-Means Algorithm for MRI Segmentation
A new model called intuitive fuzzy c-means (IFCM) model is proposed for the segmentation of magnetic resonance image in this paper. Fuzzy c-means (FCM) is one of the most widely used clustering algorithms and assigns memberships to which are inversely related to the relative distance to the point prototypes that are cluster centers in the FCM model. In order to overcome the problem of outliers in data, several models including possibilistic c-means (PCM) and possibilistic-fuzzy cmeans (PFCM) models have been proposed. In IFCM, a new measurement called intuition level is introduced so that the intuition level helps to alleviate the effect of noise. Several numerical examples are first used for experiments to compare the clustering performance of IFCM with those of FCM, PCM, and PFCM. A practical magnetic resonance image data set is then used for image segmentation experiment. Results show that IFCM compares favorably to several clustering algorithms including the SOM, FCM, CNN, PCM, and PFCM models. Since IFCM produces cluster prototypes less sensitive to outliers and to the selection of involved parameters than the other algorithms, IFCM is a good candidate for data clustering and image segmentation problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信