Wireless Video Sensors Networks (WVSNs) generally suffer from the constraint that their sensor nodes must consume very little power. In this rapidly emerging video application, the traditional video coding architecture cannot be used due to its high encoding complexity. Thankfully, some theorems from Information Theory suggest that this problem can be solved by shifting the encoder tasks, parti...

In this work we show how source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-infotmation (Gel’fand-Pinsker problem) can be merged into a single joint source/channel scheme in the quadratic Gaussian case (where the channel is known as the dirty paper channel). This scheme achieves the optimal performance RWZ(D) = CDPC without using any information...

The Lempel–Ziv complexity is a fundamental measure of complexity for words, closely connected with the famous LZ77 compression algorithm. We investigate this complexity measure for one of the most important families of infinite words in combinatorics, namely the fixed points of morphisms. We give a complete characterization of the complexity classes which are Θ(1), Θ(log n), and Θ(n1/k), k ∈ N,...

The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel’fand-Pinsker problem) can be optimally solved using the separation principle. In this work we show an alternative scheme for the quadratic-Gaussian case, which merges source and channel coding. This scheme achieves the optimal performance by a applying modulo-...

Distributed Video Coding (DVC) is a new video coding paradigm which has the ability to shift coding complexity from encoder to decoder. State-of-art DVC schemes are mainly based on two-source correlation model and only one correlation channel between side information and wyner-ziv frame is considered. In this paper, multiple-source correlation model is introduced into a famous DVC scheme, namel...

In contrast to conventional video coding, Wyner-Ziv video coders perform simple intra-frame encoding and complex inter-frame decoding. This feature makes this type of coding suitable for applications that require low-complexity encoders. In this paper, we present a model of the coding distortion introduced by pixel-domain WynerZiv video coders. Our distortion model can be used to determine the ...

In this paper, we propose a new feedback-channel-free Distributed Video Coding (DVC) algorithm using Local Rank Transform (LRT). The encoder computes LRT by considering selected neighborhood pixels of Wyner-Ziv frame. The ranks from the modified LRT are merged, and their positions are entropy coded and sent to the decoder. In addition, means of each block of WynerZiv frame are also transmitted ...

In this paper we present a rate distortion analysis and a statistical model in order to select coding parameters for memoryless coset codes, for a spatial scalability based mixed resolution Wyner-Ziv framework. The mixed resolution framework, used in this work, is based on full resolution coding of the key frames and spatial 2-layer coding of the intermediate non-reference frames where the spat...

The search for DNA regions with low complexity is one of the pivotal tasks of modern structural analysis of complete genomes. The low complexity may be preconditioned by strong inequality in nucleotide content (biased composition), by tandem or dispersed repeats or by palindrome-hairpin structures, as well as by a combination of all these factors. Several numerical measures of textual complexit...