Results 1  10
of
125,839
On Scalable Source Coding With Decoder Side
 Informations”, Proc. ISIT 2007, p. 1461  1465
, 2007
"... Abstract — We consider the problem of scalable source coding with decoder side informations. Two special cases of this problem have been investigated in the literature, namely successive refinement WynerZiv (SRWZ) coding and sideinformation scalable (SIscalable) coding, whose distinction lies in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — We consider the problem of scalable source coding with decoder side informations. Two special cases of this problem have been investigated in the literature, namely successive refinement WynerZiv (SRWZ) coding and sideinformation scalable (SIscalable) coding, whose distinction lies
Fountain coding with decoder side information
 in Proc. IEEE Int. Conf. Commun. (ICC
, 2008
"... Abstract—In this contribution, we consider the application of Digital Fountain (DF) codes to the problem of data transmission when side information is available at the decoder. The side information is modelled as a “virtual ” channel output when original information sequence is the input. For two c ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract—In this contribution, we consider the application of Digital Fountain (DF) codes to the problem of data transmission when side information is available at the decoder. The side information is modelled as a “virtual ” channel output when original information sequence is the input. For two
PSfrag replacements Source Coding with Decoder Side Information
, 2006
"... In this report, we study source coding problems with decoder side information (SI). Source coding problems with decoder side information are a special case of distributed source coding problems. We outline the relation between various distributed source coding problems in Table 1 with the help of Fi ..."
Abstract
 Add to MetaCart
In this report, we study source coding problems with decoder side information (SI). Source coding problems with decoder side information are a special case of distributed source coding problems. We outline the relation between various distributed source coding problems in Table 1 with the help
On Scalable Coding in the Presence of Decoder Side Information
"... Abstract—The problem of scalable coding while exploiting the decoder side information is considered. Prior work considered the two important cases concerning the degraded side information where source X and the side information variables (Y1, Y2) form a Markov chain in the order of either X−Y1−Y2 or ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract—The problem of scalable coding while exploiting the decoder side information is considered. Prior work considered the two important cases concerning the degraded side information where source X and the side information variables (Y1, Y2) form a Markov chain in the order of either X−Y1−Y2
Meshbased decoderside motion estimation
 Proceedings of the IEEE International Conference on Image Processing, Hong Kong
, 2010
"... Current video coding standards like H.264AVC perform a blockbased motion estimation and compensation at the encoder to exploit temporal dependencies between consecutive frames. Current research proved that motion compensation can also be done profitably at the decoder. In this socalled decodersi ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Current video coding standards like H.264AVC perform a blockbased motion estimation and compensation at the encoder to exploit temporal dependencies between consecutive frames. Current research proved that motion compensation can also be done profitably at the decoder. In this socalled decoderside
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1055 (1 self)
 Add to MetaCart
sequence { 2k}, where zk E %, the reproduction alphabet. The average distorjion level is (l/n) cl = 1 E[D(X,,z&, where D(x, $ 2 0, x E I, 2 E J, is a preassigned distortion measure. The special assumption made here is that the decoder has access to the side information {Yk}. In this paper we determine
On zeroerror source coding with decoder side information
 IEEE TRANS. INF. THEORY
, 2003
"... Let ( ) be a pair of random variables distributed over a finite product set according to a probability distribution (). The following source coding problem is considered: the encoder knows, while the decoder knows and wants to learn without error. The minimum zeroerror asymptotic rate of transmiss ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
Let ( ) be a pair of random variables distributed over a finite product set according to a probability distribution (). The following source coding problem is considered: the encoder knows, while the decoder knows and wants to learn without error. The minimum zeroerror asymptotic rate
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 (3 self)
 Add to MetaCart
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
On Scalar Quantizer Design with Decoder Side Information
, 2006
"... In this work, we investigate the design of scalar quantizers for the WynerZiv problem, where the decoder has access to a noisy copy of the source. Necessary conditions are given for the design of optimum quantizers with a fixed number of partitions for a criterion consisting of a linear combination ..."
Abstract
 Add to MetaCart
In this work, we investigate the design of scalar quantizers for the WynerZiv problem, where the decoder has access to a noisy copy of the source. Necessary conditions are given for the design of optimum quantizers with a fixed number of partitions for a criterion consisting of a linear
Results 1  10
of
125,839