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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
