This paper proposes a practical video coding framework based on distributed source coding principles, with the goal to achieve efficient and low-complexity scalable coding. Starting from a standard predictive coder as base layer (such as MPEG-4 baseline video coder in our implementation), the proposed Wyner-Ziv scalable (WZS) coder can achieve higher coding efficiency, by selectively exploiting...

Hypoxia, a noxious and hyperventilatory stimulus and a modifier of neuronal metabolism, could influence cortical function. In this study we attempted to assess any such influence, its determinants, and particularly the role in it of the accompanying hypoxic emotional distress. We addressed the issue by examining the associations among EEG, ventilation, and anxiety during progressive poikilocapn...

A meaningful set of stimuli, such as a sequence of frames from a movie, triggers a set of different experiences. By contrast, a meaningless set of stimuli, such as a sequence of 'TV noise' frames, triggers always the same experience--of seeing 'TV noise'--even though the stimuli themselves are as different from each other as the movie frames. We reasoned that the differentiation of cortical res...

Distributed Video Coding is a new solution for video surveillance because of its low complexity of the encoder. This paper introduces Distributed Video Coding theory and traditional DVC framework, and come out a hardware realization on FPGA and gives optimization methods. This paper uses integer transformation instead of DCT to reduce the computational complexity and change the organization of ...

This paper investigates the application of lossy distributed source coding to high resolution multispectral images. The choice of distributed source coding is motivated by the need for very low encoding complexity on satellite or airborne platforms. The data consists of red, blue, green and infra-red channels and is compressed in an asymmetric Wyner-Ziv setting. One image channel is compressed ...

Crochemore’s repetitions algorithm introduced in 1981 was the first O(n logn) algorithm for computing repetitions. Since then, several linear-time worst-case algorithms for computing runs have been introduced. They all follow a similar strategy: first compute the suffix tree or array, then use the suffix tree or array to compute the Lempel-Ziv factorization, then using the Lempel-Ziv factorizat...

The compression-complexity trade-off of lossy compression algorithms that are based on a random codebook or a random database is examined. Motivated, in part, by recent results of Gupta-VerdúWeissman (GVW) and their underlying connections with the pattern-matching scheme of Kontoyiannis’ lossy Lempel-Ziv algorithm, we introduce a non-universal version of the lossy Lempel-Ziv method (termed LLZ)...

A system structure, i.e., how elements of a system are connected, is a key factor for information retention and transmission through its elements. From the system dynamics, i.e., the states of the elements over time, we measure the system’s ability to propagate information through its elements as the pairwise mutual information (pMI) between the elements at moments t and t + L, where L is the m...

OBJECTIVE Review pharmacology, pharmacokinetics, efficacy, and safety of ziv-aflibercept in combination with FOLFIRI for treatment of metastatic colorectal cancer (mCRC) resistant to or progressed following oxaliplatin-containing regimens. DATA SOURCES Articles indexed in PubMed (1948-August 2013), TOXLINE (2001-August 2013), and Google Scholar as well as meeting abstracts were identified usi...

We present a new algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length N in linear time, that utilizes only N logN+O(1) bits of working space, i.e., a single integer array, for constant size integer alphabets. This greatly improves the previous best space requirement for linear time LZ77 factorization (Kärkkäinen et al. CPM 2013), which requires two integer arr...