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}
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.