Thresholding is an important task in image processing. It is a main tool in pattern recognition, image segmentation, edge detection and scene analysis. In this paper, we present a new thresholding technique based on two-dimensional Tsallis entropy. The two-dimensional Tsallis entropy was obtained from the twodimensional histogram which was determined by using the gray value of the pixels and th...

Based on the Tsallis entropy, the nonextensive thermodynamic properties are studied as a qdeformation of classical statistical results using only probabilistic methods and straightforward calculations. It is shown that the constant in the Tsallis entropy depends on the deformation parameter and must be redefined to recover the usual thermodynamic relations. The notions of variance and covarianc...

The aim of this paper is to investigate the q → 1 q duality in an information-entropy theory of all q-generalized entropy functionals (Tsallis, Renyi and Sharma-Mittal measures) in the light of a representation based on generalized exponential and logarithm functions subjected to Kolmogorov’s and Nagumo’s averaging. We show that it is precisely in this representation that the form invariance of...

We define an entropy based on a chosen governing probability distribution. If a certain kind of measurements follow such a distribution it also gives us a suitable scale to study it with. This scale will appear as a link function that is applied to the measurements. A link function can also be used to define an alternative structure on a set. We will see that generalized entropies are equivalen...

The maximum entropy principle is often used for bi-level or multi-level thresholding of images. For this purpose, some methods are available based on Shannon and Tsallis entropies. In this paper, we discuss them and propose a method based on Kaniadakis entropy.

Compressed Counting (CC) was recently proposed for approximating the αth frequency moments of data streams, for 0 < α ≤ 2. Under the relaxed strict-Turnstile model, CC dramatically improves the standard algorithm based on symmetric stable random projections, especially as α → 1. A direct application of CC is to estimate the entropy, which is an important summary statistic in Web/network measure...

We formulate a convenient generalization of the q-expectation value, based on the analogy of the symmetric quantum groups and q-calculus, and show that the q ↔ q−1 symmetric nonextensive entropy preserves all of the mathematical structure of thermodynamics just as in the case of non-symmetric Tsallis statistics. Basic properties and analogies with quantum groups are discussed. PACS: 05.20.-y; 0...

The Kolmogorov-Sinai entropy in the sense of Tsallis under Bernoulli shifts was obtained by Mesón and Vericat [J. Math. Phys. 37, 4480(1996)]. In this paper, we propose a revised generalized Kolmogorov-Sinai-q entropy under Markov shifts. The form of this generalized entropy with factor q is nonextensive. The new generalized entropy contains the classical Kolmogorov-Sinai entropy and Renýı entr...

This review provides a summary of methods originated in (non-equilibrium) statistical mechanics and information theory, which have recently found successful applications to quantitatively studying complexity in various components of the complex Entropy 2013, 15 4845 system Earth. Specifically, we discuss two classes of methods: (i) entropies of different kinds (e.g., on the one hand classical S...

Using Rényi entropy, an alternative statistics to Tsallis one for nonextensive systems at equilibrium is discussed. We show that it is possible to have the q-exponential distribution function for equilibrium nonextensive systems having nonadditive energy but additive entropy. PACS : 02.50.-r, 05.20.-y, 05.70.-a