{"title":"基于tsallis -熵和renyi -熵的图像分割及其比较","authors":"Y. Li, Xiaoping Fan, Gang Li","doi":"10.1109/INDIN.2006.275704","DOIUrl":null,"url":null,"abstract":"Image segmentation is one of the most critical tasks in image processing. The non-extensive (or non-additive) entropy, i.e. Tsallis, is a recent development in statistical mechanics. A threshold segmentation algorithm based on the difference minimum of Tsallis entropy is presented because Tsallis entropy can't be added directly. Tsallis entropy has an additional parameter comparing to other entropies. The additional parameter makes it process more type of image. Tsallis entropy and Renyi entropy have some relationship, so we also provide the threshold segmentation algorithm based on the difference minimum of Renyi. Two methods are compared. The algorithms and other algorithms based on other entropies are experimented. The simulating result shows that this algorithm is better than other algorithms.","PeriodicalId":120426,"journal":{"name":"2006 4th IEEE International Conference on Industrial Informatics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Image Segmentation based on Tsallis-entropy and Renyi-entropy and Their Comparison\",\"authors\":\"Y. Li, Xiaoping Fan, Gang Li\",\"doi\":\"10.1109/INDIN.2006.275704\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Image segmentation is one of the most critical tasks in image processing. The non-extensive (or non-additive) entropy, i.e. Tsallis, is a recent development in statistical mechanics. A threshold segmentation algorithm based on the difference minimum of Tsallis entropy is presented because Tsallis entropy can't be added directly. Tsallis entropy has an additional parameter comparing to other entropies. The additional parameter makes it process more type of image. Tsallis entropy and Renyi entropy have some relationship, so we also provide the threshold segmentation algorithm based on the difference minimum of Renyi. Two methods are compared. The algorithms and other algorithms based on other entropies are experimented. The simulating result shows that this algorithm is better than other algorithms.\",\"PeriodicalId\":120426,\"journal\":{\"name\":\"2006 4th IEEE International Conference on Industrial Informatics\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 4th IEEE International Conference on Industrial Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDIN.2006.275704\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 4th IEEE International Conference on Industrial Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDIN.2006.275704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Image Segmentation based on Tsallis-entropy and Renyi-entropy and Their Comparison
Image segmentation is one of the most critical tasks in image processing. The non-extensive (or non-additive) entropy, i.e. Tsallis, is a recent development in statistical mechanics. A threshold segmentation algorithm based on the difference minimum of Tsallis entropy is presented because Tsallis entropy can't be added directly. Tsallis entropy has an additional parameter comparing to other entropies. The additional parameter makes it process more type of image. Tsallis entropy and Renyi entropy have some relationship, so we also provide the threshold segmentation algorithm based on the difference minimum of Renyi. Two methods are compared. The algorithms and other algorithms based on other entropies are experimented. The simulating result shows that this algorithm is better than other algorithms.