A non-extensive entropy feature and its application to texture classification
Seba Susan, Madasu Hanmandlu

TL;DR
This paper introduces a novel non-extensive entropy feature based on Gaussian information for texture classification, demonstrating superior accuracy and effectiveness over traditional entropies in representing correlated textures.
Contribution
It presents a new non-extensive entropy measure that is bounded, non-additive, and effective for texture analysis, outperforming existing entropy measures.
Findings
High classification accuracy achieved with the new entropy.
Superior performance over Shannon, Renyi, Tsallis, and Pal entropies.
Effective representation of correlated textures using the proposed entropy.
Abstract
This paper proposes a new probabilistic non-extensive entropy feature for texture characterization, based on a Gaussian information measure. The highlights of the new entropy are that it is bounded by finite limits and that it is non additive in nature. The non additive property of the proposed entropy makes it useful for the representation of information content in the non-extensive systems containing some degree of regularity or correlation. The effectiveness of the proposed entropy in representing the correlated random variables is demonstrated by applying it for the texture classification problem since textures found in nature are random and at the same time contain some degree of correlation or regularity at some scale. The gray level co-occurrence probabilities (GLCP) are used for computing the entropy function. The experimental results indicate high degree of the classification…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
