A new video coding paradigm, distributed video coding, has been the focus of many recent studies. In this paper we present a simple video coding framework, based on the principles of distributed coding, that can be applied to any video coding standards with minor modifications. The framework allows spatial scalability of the non-reference frames, and does not need any feedback channel between t...

To investigate the characteristics of extreme events in financial markets and the corresponding return intervals among these events, we use a Potts dynamic system to construct a random financial time series model of the attitudes of market traders. We use multiscale multifractal detrended cross-correlation analysis (MM-DCCA) and Lempel–Ziv complexity (LZC) perform numerical research of the retu...

Distributed source coding (DSC) is a new coding paradigm based on two Information Theory results: Slepian-Wolf and Wyner-Ziv theorems. DSC theory relies on the coding of two or more dependent random sequences in an independent way, i.e. associating an independent encoder to each sequence. A single decoder is used to perform joint decoding of all encoded sequences exploiting the statistical depe...

BACKGROUND Analysis of signals by means of symbolic methods consists in calculating a measure of signal complexity, for example informational entropy or Lempel-Ziv algorithmic complexity. For construction of these entropic measures one uses distributions of symbols representing the analyzed signal. RESULTS We introduce a new signal characteristic named sequential spectrum that is suitable for...

Magnetoencephalography (MEG) allows the real-time recording of neural activity and oscillatory activity in distributed neural networks. We applied a non-linear complexity analysis to resting-state neural activity as measured using whole-head MEG. Recordings were obtained from 20 unmedicated patients with major depressive disorder and 19 matched healthy controls. Subsequently, after 6 months of ...

We present the first worst-case linear-time algorithm to compute the Lempel-Ziv 78 factorization of a given string over an integer alphabet. Our algorithm is based on nearest marked ancestor queries on the suffix tree of the given string. We also show that the same technique can be used to construct the position heap of a set of strings in worst-case linear time, when the set of strings is give...

In this correspondence we investigate the performance of the Lempel–Ziv incremental parsing scheme on nonstationary sources. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source. We also show a similar result for a lossy coding scheme given by Yang and Kieffer which uses a Lempel–Ziv scheme to perform lossy coding.

We present the first thorough practical study of the Lempel-Ziv-78 and the Lempel-Ziv-Welch computation based on trie data structures. With a careful selection of trie representations we can beat well-tuned popular trie data structures like Judy, m-Bonsai or Cedar.

A compression algorithm takes a finite structure of a class K as input and produces a finite structure of a different class K’ as output. Given a property P on the class K defined in a logicL, we study the definability of property P on the class K’. We consider two compression schemas on unary ordered structures (words), compression by runlength encoding and the classical Lempel-Ziv. First-orde...