Multiscale entropy (MSE) was proposed to overcome the deficiencies of conventional entropy methods when quantifying the complexity of time series. However, MSE is not fast enough for real-time applications because of the use of sample entropy (SampEn). Here, we introduce multiscale DisEn (MDE) as a very fast and powerful method to quantify the complexity of signals. MDE is based on our recently...

In the RESUME project (Reconfigurable Embedded Systems for Use in Multimedia Environments) we explore the benefits of an implementation of scalable multimedia applications using reconfigurable hardware by building an FPGA implementation of a scalable wavelet-based video decoder. The term ‘scalable’ refers to a design that can easily accommodate changes in quality of service with minimal computa...

This paper formulates bottom-up visual saliency as center surround conditional entropy and presents a fast and efficient technique for the computation of such a saliency map. It is shown that the new saliency formulation is consistent with self-information based saliency, decision-theoretic saliency and Bayesian definition of surprises but also faces the same significant computational challenge...

Entropy-constrained vector quantization (ECVQ) offers substantially improved image quality over vector quantization (VQ) at the cost of additional encoding complexity. We extend results in the literature for fast nearest neighbor search of VQ to ECVQ. We use a new, easily computed distance that successfully eliminates most codewords from consideration.

Purpose To propose a static automated perimetry strategy that increases the speed of visual field (VF) evaluation while retaining threshold estimate accuracy. Methods We propose a novel algorithm, spatial entropy pursuit (SEP), which evaluates individual locations by using zippy estimation by sequential testing (ZEST) but additionally uses neighboring locations to estimate the sensitivity of ...

Estimating entropy for true random number generators is a task of critical importance, because feeding cryptographic applications with insufficient entropy leads to poor security. This is a challenging task as the entropy needs to be estimated at high accuracy, high confidence level and with possibly minimal number of samples (ideally no more than needed for extraction), In this paper we analyz...

In this paper we consider a family of Caffarelli-Kohn-Nirenberg interpolation inequalities (CKN), with two radial power law weights and exponents in a subcritical range. We address the question of symmetry breaking: are the optimal functions radially symmetric, or not ? Our intuition comes from a weighted fast diffusion (WFD) flow: if symmetry holds, then an explicit entropy – entropy productio...