Results related to exponential entropy Online publication date: Mon, 02-Oct-2017
by Sajjad Mazloum Panjehkeh; Gholam Reza Mohtashami Borzadaran; Mohammad Amini
International Journal of Information and Coding Theory (IJICOT), Vol. 4, No. 4, 2017
Abstract: The Shannon entropy which is widely used in many fields of science, some advantage and disadvantage of it are noticeable. In view of disadvantage formulated, other entropies like exponential entropy. In this paper, we study some characterisation and properties of exponential entropy such as asymptotic equipartition property, chain rule, the subadditivity, invariancy under monotone transformation in parallel to those for the Shannon entropy in continuous and discrete cases. Also, the relationship between exponential entropy with Tsallis entropy and Renyi entropy obtained. Finally, we show that in the image segmentation, algorithms based on exponential entropy has a better performance than the algorithms which are based on the Shannon entropy.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com