#### Filter Results:

#### Publication Year

2009

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using memory models. We consider five chain codes, including the widely used AF8 and 3OT codes, and note that they correspond to memory models of first and second order for contour… (More)

- Avital Sadot, Septimia Sarbu, Juha Kesseli, Hila Amir-Kroll, Wei Zhang, Matti Nykter +1 other
- PloS one
- 2013

To facilitate analysis and understanding of biological systems, large-scale data are often integrated into models using a variety of mathematical and computational approaches. Such models describe the dynamics of the biological system and can be used to study the changes in the state of the system over time. For many model classes, such as discrete or… (More)

We study in this paper ways to reduce the complexity required by a vector quantization scheme, which uses the shells of Golay codes for coding sub-vectors of the input vector. Such a scheme was recently shown to achieve top performance in terms of segmental SNR in the generic situation of data affected by outliers, which is relevant for the case of audio… (More)

—We prove the Courtade-Kumar conjecture, for certain classes of n-dimensional Boolean functions, ∀n ≥ 2 and for all values of the error probability of the binary symmetric channel, ∀0 ≤ p ≤ 1 2. Let X = [X1. .. Xn] be a vector of independent and identically distributed Bernoulli(1 2) random variables, which are the input to a memoryless binary symmetric… (More)

We prove the Courtade-Kumar conjecture, for several classes of n-dimensional Boolean functions, for all n ≥ 2 and for all values of the error probability of the binary symmetric channel, 0 ≤ p ≤ 1 2. This conjecture states that the mutual information between any Boolean function of an n-dimensional vector of independent and identically distributed inputs to… (More)

Rényi's entropies play a significant role in many signal processing applications. Plug-in kernel density estimation methods have been employed to estimate such entropies with good results. However, they become computationally intractable in higher dimensions, because of the requirement to store intermediate probability density values for a large… (More)

We prove the Courtade-Kumar conjecture, which states that the mutual information between any Boolean function of an n-dimensional vector of independent and identically distributed inputs to a memoryless binary symmetric channel and the corresponding vector of outputs is upper-bounded by 1 − H(p), where H(p) represents the binary entropy function. That is,… (More)

Complex systems have received growing interest recently, due to their universal presence in all areas of science and engineering. Complex networks represent a simplified description of the interactions present in such systems. Boolean networks were introduced as models of gene regulatory networks. Simple enough to be computationally tractable, they capture… (More)

Shannon and Rényi information theory have been applied to coupling estimation in complex systems using time series of their dynamical states. By analysing how information is transferred between constituent parts of a complex system, it is possible to infer the coupling parameters of the system. To this end, we introduce the partial Rényi… (More)

Shannon and Rényi information theory have been applied to coupling estimation in complex systems using time series of their dynamical states. By analysing how information is transferred between constituent parts of a complex system, it is possible to infer the coupling parameters of the system. To this end, we introduce the partial Rényi transfer entropy… (More)