Carely Guada, D. Gómez, Juan Tinguaro Rodríguez, J. Yáñez, J. Montero
{"title":"基于层次分割和链接聚类算法的模糊图像分割","authors":"Carely Guada, D. Gómez, Juan Tinguaro Rodríguez, J. Yáñez, J. Montero","doi":"10.1109/ISKE.2015.89","DOIUrl":null,"url":null,"abstract":"In this paper, we present a method to obtain a Fuzzy Image Segmentation from the hierarchical clustering algorithm Divide and Link. The Divide and Link algorithm consists on treating a digital image as a graph, then building spanning forest through a Kruskal scheme to successively sort the edges while partitions are obtained. This process is driven until all the pixels of the image are segmented, that is, there are as many regions as pixels.","PeriodicalId":312629,"journal":{"name":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Fuzzy Image Segmentation Based on the Hierarchical Divide and Link Clustering Algorithm\",\"authors\":\"Carely Guada, D. Gómez, Juan Tinguaro Rodríguez, J. Yáñez, J. Montero\",\"doi\":\"10.1109/ISKE.2015.89\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a method to obtain a Fuzzy Image Segmentation from the hierarchical clustering algorithm Divide and Link. The Divide and Link algorithm consists on treating a digital image as a graph, then building spanning forest through a Kruskal scheme to successively sort the edges while partitions are obtained. This process is driven until all the pixels of the image are segmented, that is, there are as many regions as pixels.\",\"PeriodicalId\":312629,\"journal\":{\"name\":\"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE.2015.89\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2015.89","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fuzzy Image Segmentation Based on the Hierarchical Divide and Link Clustering Algorithm
In this paper, we present a method to obtain a Fuzzy Image Segmentation from the hierarchical clustering algorithm Divide and Link. The Divide and Link algorithm consists on treating a digital image as a graph, then building spanning forest through a Kruskal scheme to successively sort the edges while partitions are obtained. This process is driven until all the pixels of the image are segmented, that is, there are as many regions as pixels.