{"title":"Three-Level Gray-Scale Images Segmentation using Non-extensive Entropy","authors":"I. El-Feghi, M. Galhoud, M. Sid-Ahmed, M. Ahmadi","doi":"10.1109/CGIV.2007.83","DOIUrl":null,"url":null,"abstract":"The segmentation of images into meaningful and homogenous regions is a crucial step in many image analysis applications. In this paper, we present a three-level thresholding method for image segmentation. The method is based on maximizing non-extensive entropy. After segmentation, the output image will consist of three homogenous regions, namely, dark, gray and white. The threshold value for each region is decided by maximizing an extended form of Tsallis entropy. To improve the performance of the proposed algorithm, an efficient and computationally fast method for initializing the search for maximum entropy is also presented. Results obtained using the proposed algorithm are compared with those obtained using Shannon entropy.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGIV.2007.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
The segmentation of images into meaningful and homogenous regions is a crucial step in many image analysis applications. In this paper, we present a three-level thresholding method for image segmentation. The method is based on maximizing non-extensive entropy. After segmentation, the output image will consist of three homogenous regions, namely, dark, gray and white. The threshold value for each region is decided by maximizing an extended form of Tsallis entropy. To improve the performance of the proposed algorithm, an efficient and computationally fast method for initializing the search for maximum entropy is also presented. Results obtained using the proposed algorithm are compared with those obtained using Shannon entropy.