基于聚类算法、融合和水平集的快速无监督纹理边界定位方法

Mehryar Emambakhsh, Mohammad Hossein Sedaaghi, H. Ebrahimnezhad
{"title":"基于聚类算法、融合和水平集的快速无监督纹理边界定位方法","authors":"Mehryar Emambakhsh, Mohammad Hossein Sedaaghi, H. Ebrahimnezhad","doi":"10.1109/ICSIPA.2009.5478632","DOIUrl":null,"url":null,"abstract":"Image segmentation deals with partitioning an input image into disjoint/non-overlapping regions. Among different segmentation algorithms, level set methods have been very popular. Less sensitivity to initialization, ability to split and merge the contour, and also, involving statistical inference have made level set even more accepted than similar methods like snakes. However, it is very time-consuming. To solve this problem, in this paper a fast variational approach is presented for texture segmentation. For this purpose, first a feature space based on non-linear diffusion is set up from CIE L*a*b* colour components. Then, this feature space is clustered by fusion of clustering algorithms. Finally, the produced cluster map is used in level set for contour evolution. As it is shown in the simulation results, our algorithm is robust in segmenting noisy texture. Also, it is faster than previous level set approaches for texture segmentation.","PeriodicalId":400165,"journal":{"name":"2009 IEEE International Conference on Signal and Image Processing Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Locating texture boundaries using a fast unsupervised approach based on clustering algorithms fusion and level set\",\"authors\":\"Mehryar Emambakhsh, Mohammad Hossein Sedaaghi, H. Ebrahimnezhad\",\"doi\":\"10.1109/ICSIPA.2009.5478632\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Image segmentation deals with partitioning an input image into disjoint/non-overlapping regions. Among different segmentation algorithms, level set methods have been very popular. Less sensitivity to initialization, ability to split and merge the contour, and also, involving statistical inference have made level set even more accepted than similar methods like snakes. However, it is very time-consuming. To solve this problem, in this paper a fast variational approach is presented for texture segmentation. For this purpose, first a feature space based on non-linear diffusion is set up from CIE L*a*b* colour components. Then, this feature space is clustered by fusion of clustering algorithms. Finally, the produced cluster map is used in level set for contour evolution. As it is shown in the simulation results, our algorithm is robust in segmenting noisy texture. Also, it is faster than previous level set approaches for texture segmentation.\",\"PeriodicalId\":400165,\"journal\":{\"name\":\"2009 IEEE International Conference on Signal and Image Processing Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Signal and Image Processing Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSIPA.2009.5478632\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Signal and Image Processing Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSIPA.2009.5478632","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

图像分割处理将输入图像划分为不相交/不重叠的区域。在不同的分割算法中,水平集方法一直是非常受欢迎的。对初始化的敏感度较低,分割和合并轮廓的能力,以及涉及统计推断的能力,使得水平集比类似的方法(如蛇)更容易被接受。然而,这是非常耗时的。为了解决这一问题,本文提出了一种快速变分纹理分割方法。为此,首先从CIE L*a*b*颜色分量中建立基于非线性扩散的特征空间。然后,通过融合聚类算法对该特征空间进行聚类。最后,将生成的聚类图用于等值线演化的水平集。仿真结果表明,该算法对噪声纹理的分割具有较好的鲁棒性。此外,它比以前的水平集方法更快的纹理分割。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Locating texture boundaries using a fast unsupervised approach based on clustering algorithms fusion and level set
Image segmentation deals with partitioning an input image into disjoint/non-overlapping regions. Among different segmentation algorithms, level set methods have been very popular. Less sensitivity to initialization, ability to split and merge the contour, and also, involving statistical inference have made level set even more accepted than similar methods like snakes. However, it is very time-consuming. To solve this problem, in this paper a fast variational approach is presented for texture segmentation. For this purpose, first a feature space based on non-linear diffusion is set up from CIE L*a*b* colour components. Then, this feature space is clustered by fusion of clustering algorithms. Finally, the produced cluster map is used in level set for contour evolution. As it is shown in the simulation results, our algorithm is robust in segmenting noisy texture. Also, it is faster than previous level set approaches for texture segmentation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信