Results 11  20
of
56
Successive WynerZiv Coding Scheme and its Application to the Quadratic Gaussian CEO Problem
, 2006
"... We introduce a distributed source coding scheme called successive WynerZiv coding. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive WynerZiv coding. The concept of successive refinement in the single source coding is generalized to ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
(Show Context)
We introduce a distributed source coding scheme called successive WynerZiv coding. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive WynerZiv coding. The concept of successive refinement in the single source coding is generalized to the distributed source coding scenario, which we refer to as distributed successive refinement. For the quadratic Gaussian CEO problem, we establish a necessary and sufficient condition for distributed successive refinement, where the successive WynerZiv coding scheme plays an important role.
Multiterminal video coding
 in Information Theory and Applications Workshop
, 2007
"... Abstract — Following recent works on the rate region of the quadratic Gaussian twoterminal source coding problem and limitapproaching code designs, this paper examines multiterminal source coding of two correlated video sequences to save the sum rate over independent coding. Specifically, the firs ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
Abstract — Following recent works on the rate region of the quadratic Gaussian twoterminal source coding problem and limitapproaching code designs, this paper examines multiterminal source coding of two correlated video sequences to save the sum rate over independent coding. Specifically, the first video sequence is coded by H.264 and used at the joint decoder to facilitate WynerZiv coding of the second video sequence. An efficient stereo matching algorithm based on loopy belief propagation is then adopted at the decoder to produce pixellevel disparity maps between the corresponding frames of the two decoded video sequences on the fly. Based on the disparity maps, side information for both motion vectors and motioncompensated residual frames of the second sequence are generated at the decoder before WynerZiv encoding. Preliminary results on stereo video sequences using H.264 in conjunction with LDPC codes for SlepianWolf coding of the motion vectors show savings in terms of the sum rate when compared to separate coding at the same video quality. I.
Multiterminal source coding with complementary delivery
, 2008
"... A coding problem for correlated information sources is investigated. Messages emitted from two correlated sources are jointly encoded, and delivered to two decoders. Each decoder has access to one of the two messages to enable it to reproduce the other message. The ratedistortion function for the c ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
A coding problem for correlated information sources is investigated. Messages emitted from two correlated sources are jointly encoded, and delivered to two decoders. Each decoder has access to one of the two messages to enable it to reproduce the other message. The ratedistortion function for the coding problem and its interesting properties are clarified.
Minimum Expected Distortion in Gaussian Source Coding with Uncertain Side Information
"... Abstract — We consider a layered approach to source coding with side information received over an uncertain channel that minimizes expected distortion. Specifically, we assume a Gaussian source encoder whereby the decoder receives a compressed version of the symbol at a given rate, as well as an unc ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Abstract — We consider a layered approach to source coding with side information received over an uncertain channel that minimizes expected distortion. Specifically, we assume a Gaussian source encoder whereby the decoder receives a compressed version of the symbol at a given rate, as well as an uncompressed version over a separate sideinformation channel with slow fading and noise. The decoder knows the realization of the slow fading but the encoder knows only its distribution. We consider a layered encoding strategy with a base layer describing the source assuming worstcase fading on the sideinformation channel, and subsequent layers describing the source under better fading conditions. Optimization of the layering scheme utilizes the HeegardBerger ratedistortion function that describes the rate required to meet a different distortion constraint for each fading state. When the sideinformation channel has two discrete fading states, we obtain closedform expressions for the optimal rate allocation between the fading states and the resulting minimum expected distortion. For multiple fading states, the minimum expected distortion is formulated as the solution of a convex optimization problem. Under discretized Rayleigh fading, we show that the optimal rate allocation puts almost all rate into the base layer associated with the worstcase fading. This implies that uncertain side information yields little performance benefit over no side information. Moreover, as the source coding rate increases, the benefit of uncertain sideinformation decreases. I.
Cascade and triangular source coding with side information at the first two nodes
 IN PROC. INF. THEORY APPL. WORKSHOP
, 2012
"... We consider the cascade and triangular ratedistortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the ratedistortion region for these problems, as well as some of their extensions. For the quadratic Gaussian case, ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
We consider the cascade and triangular ratedistortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the ratedistortion region for these problems, as well as some of their extensions. For the quadratic Gaussian case, we show that it is sufficient to consider jointly Gaussian distributions, which leads to an explicit solution.
On the Continuity of Achievable Rate Regions for Source Coding over Networks
"... Abstract — The continuity property of achievable rate regions for source coding over networks is considered. We show ratedistortion regions are continuous with respect to distortion vectors. Then we focus on the continuity of lossless rate regions with respect to source distribution: First, the proo ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract — The continuity property of achievable rate regions for source coding over networks is considered. We show ratedistortion regions are continuous with respect to distortion vectors. Then we focus on the continuity of lossless rate regions with respect to source distribution: First, the proof of continuity for general networks with independent sources is given; then, for the case of dependent sources, continuity is proven both in examples where oneletter characterizations are known and in examples where oneletter characterizations are not known; the proofs in the latter case rely on the concavity of the rate regions for those networks. I.
Source coding when the side information may be delayed”, submitted to
 IEEE Trans. Inf. Theory
, 2012
"... Abstract—For memoryless sources, delayed side information at the decoder does not improve the ratedistortion function. However, this is not the case for sources with memory, as demonstrated by a number of works focusing on the special case of (delayed) feedforward. In this paper, a setting is stu ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract—For memoryless sources, delayed side information at the decoder does not improve the ratedistortion function. However, this is not the case for sources with memory, as demonstrated by a number of works focusing on the special case of (delayed) feedforward. In this paper, a setting is studied in which the encoder is potentially uncertain about the delay with which measurements of the side information, which is available at the encoder, are acquired at the decoder. Assuming a hidden Markov model for the source sequences, at first, a singleletter characterization is given for the setup where the side information delay is arbitrary and known at the encoder, and the reconstruction at the destination is required to be asymptotically lossless. Then, with delay equal to zero or one source symbol, a singleletter characterization of the ratedistortion region is given for the case where, unbeknownst to the encoder, the side information may be delayed or not. Finally, examples for binary and Gaussian sources are provided. Index Terms—Causal conditioning, hidden Markov model, Markov Gaussian process, multiplexing, ratedistortion function, strictly causal side information. I.
On multiple description source coding with decoder side information
 in Proc. IEEE Information Theory Workshop
, 2004
"... Abstract — We formulate a multiterminal source coding problem, where we are required to construct a multipledescription code for a source sequence when side information about dependent random processes is available at the decoder only, or at both the decoder and the encoder. We describe an achievab ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Abstract — We formulate a multiterminal source coding problem, where we are required to construct a multipledescription code for a source sequence when side information about dependent random processes is available at the decoder only, or at both the decoder and the encoder. We describe an achievable ratedistortion region for these problems in two cases: where there is common sideinformation at the decoders and when they are different. In the quadratic Gaussian case, and when there is common side information among the decoders, we show that the rate region when both the encoder and decoder have access to the side information coincides with that of decoder–only side information. This is analogous to the singledescription (WynerZiv) case, and an explicit characterization of the ratedistortion region is provided for this case. I.
On scalable source coding for multiple decoders with sideinformation
 in UCSD ITA Center Inaugural Workshop
, 2006
"... Abstract — The problem of sideinformation scalable (SIscalable) source coding and the problem of successive refinement in the WynerZiv (SRWZ) setting are considered in this paper. Both problems can be understood as special cases of the general problem of scalable lossy source coding for multiple ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Abstract — The problem of sideinformation scalable (SIscalable) source coding and the problem of successive refinement in the WynerZiv (SRWZ) setting are considered in this paper. Both problems can be understood as special cases of the general problem of scalable lossy source coding for multiple decoders with access to side informations, but the encoder does not. In the former problem, the quality of the side informations deteriorates from the early stage to the later stage, while in the latter problem, the quality of the side informations improves with the stages. The SRWZ problem was considered by Steinberg and Merhav (TIT, 2004) where it was solved for the special case of two stages. We provide a generalization of their characterization to multiple stages. We also provide achievable rate and outer bounds for the SIscalable coding problem. Furthermore, the notion of generalized successively refinability with multiple side informations is introduced, which captures whether progressive encoding to satisfy the distortion constraints for different side information is as good as encoding without progressive requirement. For the quadratic Gaussian case, by combining the results of SIscalable and SRWZ coding, we provide a complete answer to the general scalable source coding problem. I.
Distributed multistage coding of correlated sources
 in Proc. IEEE Data Compress. Conf
, 2008
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.