Entropy-based divergence measures have shown promising results in many areas of engineering and image processing. In this paper, we define a new generalized divergence measure, namely, the Jensen–Rényi divergence. Some properties such as convexity and its upper bound are derived. Based on the Jensen–Rényi divergence, we propose a new approach to the problem of image registration. Some appealing...

The aim of this paper is to show that the Tsallis-type (q-additive) entropic chain rule allows for a wider class of entropic functionals than previously thought. In particular, we point out that the ensuing entropy solutions (e.g., Tsallis entropy) can be determined uniquely only when one fixes the prescription for handling conditional entropies. By using the concept of Kolmogorov–Nagumo quasi-...

We study convexity properties of the Rényi entropy as function $\alpha >0$ on finite alphabets. also describe robustness alphabets, and it turns out that rate respective convergence depends initial alphabet. establish disturbed when distribution is uniform but number events increases to ? prove limit binomial equal Poisson distribution.