Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropy-constrained scalar quantizer (ECSQ) design. However, contradicting intuition and previously published assertions, there are finite block length permutation c...

Ziya Arnavut Computer Science and Engineering, University of Nebraska-Lincoln, NE 68588 [email protected] Linear prediction schemes, such as JPEG or BJPEG, are simple and normally result in a significant reduction in source entropy. Occasionally the entropy of the prediction error becomes greater than that of the original image. Such situations frequently occur when the image data has discre...

Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation, e.g., incremental Delauney triangulation of a pointset, where points are added one by one, and where we always maintain the Delauney triangulation of the points...

This paper investigates the complex behaviors and entropy properties for a novel random complex interacting stock price dynamics, which is established by the combination of stochastic contact process and compound Poisson process, concerning with stock return fluctuations caused by the spread of investors’ attitudes and random jump fluctuations caused by the macroeconomic environment, respective...

The dynamics of brain area influenced by focal epilepsy can be studied using focal and non-focal electroencephalogram (EEG) signals. This paper presents a new method to detect focal and non-focal EEG signals based on an integrated index, termed the focal and non-focal index (FNFI), developed using discrete wavelet transform (DWT) and entropy features. The DWT decomposes the EEG signals up to si...

The separation of the information in a vector into order (a permutation) and value (a multiset) is studied. We formulate rate-distortion problems in which order is irrelevant, for which we give conclusive results in cases where the set size approaches infinity. Conversely, we present a distortion measure on partial orders and source coding techniques based on partial orders. Multiple partial or...