Results 1  10
of
18
Lattices for distributed source coding: Jointly Gaussian sources and reconstruction of a linear function
 IEEE TRANSACTIONS ON INFORMATION THEORY, SUBMITTED
, 2007
"... Consider a pair of correlated Gaussian sources (X1, X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear combination of X1 and X2 to within a meansquare distortion of ..."
Abstract

Cited by 45 (2 self)
 Add to MetaCart
(Show Context)
Consider a pair of correlated Gaussian sources (X1, X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear combination of X1 and X2 to within a meansquare distortion of D. We obtain an inner bound to the optimal ratedistortion region for this problem. A portion of this inner bound is achieved by a scheme that reconstructs the linear function directly rather than reconstructing the individual components X1 and X2 first. This results in a better rate region for certain parameter values. Our coding scheme relies on lattice coding techniques in contrast to more prevalent random coding arguments used to demonstrate achievable rate regions in information theory. We then consider the case of linear reconstruction of K sources and provide an inner bound to the optimal ratedistortion region. Some parts of the inner bound are achieved using the following coding structure: lattice vector quantization followed by “correlated” latticestructured binning.
Multiple Description Quantization Via GramSchmidt Orthogonalization
, 2005
"... The multiple description (MD) problem has received considerable attention as a model of information transmission over unreliable channels. A general framework for designing efficient multiple description quantization schemes is proposed in this paper. We provide a systematic treatment of the El Gama ..."
Abstract

Cited by 29 (11 self)
 Add to MetaCart
(Show Context)
The multiple description (MD) problem has received considerable attention as a model of information transmission over unreliable channels. A general framework for designing efficient multiple description quantization schemes is proposed in this paper. We provide a systematic treatment of the El GamalCover (EGC) achievable MD ratedistortion region, and show that any point in the EGC region can be achieved via a successive quantization scheme along with quantization splitting. For the quadratic Gaussian case, the proposed scheme has an intrinsic connection with the GramSchmidt orthogonalization, which implies that the whole Gaussian MD ratedistortion region is achievable with a sequential dithered latticebased quantization scheme as the dimension of the (optimal) lattice quantizers becomes large. Moreover, this scheme is shown to be universal for all i.i.d. smooth sources with performance no worse than that for an i.i.d. Gaussian source with the same variance and asymptotically optimal at high resolution. A class of lowcomplexity MD scalar quantizers in the proposed general framework also is constructed and is illustrated geometrically; the performance is analyzed in the high resolution regime, which exhibits a noticeable improvement over the existing MD scalar quantization schemes.
Dynamic information and constraints in source and channel coding
, 2004
"... explore dynamics in source coding and channel coding. We begin by introducing the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. Such distortion side information is not only useful at the encoder but under certain conditi ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
(Show Context)
explore dynamics in source coding and channel coding. We begin by introducing the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. Such distortion side information is not only useful at the encoder but under certain conditions knowing it at the encoder is optimal and knowing it at the decoder is useless. Thus distortion side information is a natural complement to WynerZiv side information and may be useful in exploiting properties of the human perceptual system as well as in sensor or control applications. In addition to developing the theoretical limits of source coding with distortion side information, we also construct practical quantizers based on lattices and codes on graphs. Our use of codes on graphs is also of independent interest since it highlights some issues in translating the success of turbo and LDPC codes into the realm of source coding. Finally, to explore the dynamics of side information correlated with the source, we consider fixed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding with feedforward (the dual
Universal Multiple Description Scalar Quantization: Analysis and Design
 IEEE Trans. Information Theory
, 2004
"... This paper introduces a new highrate analysis of the entropyconstrained multiple description scalar quantizer (ECMDSQ). The analysis provides insight into the structure of the ECMDSQ, suggesting the nonoptimality of uniform central quantizer cells with finite diagonals in the index assignment ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
(Show Context)
This paper introduces a new highrate analysis of the entropyconstrained multiple description scalar quantizer (ECMDSQ). The analysis provides insight into the structure of the ECMDSQ, suggesting the nonoptimality of uniform central quantizer cells with finite diagonals in the index assignment matrix, as well as a method to approximate optimal cell sizes. Based on these insights, a Universal Multiple Description Scalar Quantizer (UMDSQ) is proposed which can achieve nearly the same performance as the fully optimized ECMDSQ [1], at much lower design complexity. The design requires selection of only two parameters, and the resulting UMDSQ can provide a continuum of tradeo# points between the central and side distortions as the two parameters are varied.
Multipledescription coding by dithered deltasigma quantization
 in Data Compression Conference, 2007. DCC ’07, (Snowbird, UT
, 2007
"... We address the connection between the multipledescription (MD) problem and DeltaSigma quantization. The inherent redundancy due to oversampling in DeltaSigma quantization, and the simple linearadditive noise model resulting from dithered lattice quantization, allow us to construct a symmetric and ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
(Show Context)
We address the connection between the multipledescription (MD) problem and DeltaSigma quantization. The inherent redundancy due to oversampling in DeltaSigma quantization, and the simple linearadditive noise model resulting from dithered lattice quantization, allow us to construct a symmetric and timeinvariant MD coding scheme. We show that the use of a noise shaping filter makes it possible to trade off central distortion for side distortion. Asymptotically as the dimension of the lattice vector quantizer and order of the noise shaping filter approach infinity, the entropy rate of the dithered DeltaSigma quantization scheme approaches the symmetric twochannel MD ratedistortion function for a memoryless Gaussian source and MSE fidelity criterion, at any sidetocentral distortion ratio and any resolution. In the optimal scheme, the infiniteorder noise shaping filter must be minimum phase and have a piecewise flat power spectrum with a single jump discontinuity. An important advantage of the proposed design is that it is symmetric in rate and distortion by construction, so the coding rates of the descriptions are identical and there is therefore no need for source splitting. Index Terms deltasigma modulation, dithered lattice quantization, entropy coding, joint sourcechannel coding, multipledescription coding, vector quantization. I.
Improved bounds for the rate loss of multiresolution source codes
 IEEE Transactions on Information Theory
, 2003
"... Abstract—In this paper, we present new bounds for the rate loss of multiresolution source codes (MRSCs). Considering anresolution code, the rate loss at the th resolution with distortion is defined as = (), where is the rate achievable by the MRSC at stage. This rate loss describes the performanc ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we present new bounds for the rate loss of multiresolution source codes (MRSCs). Considering anresolution code, the rate loss at the th resolution with distortion is defined as = (), where is the rate achievable by the MRSC at stage. This rate loss describes the performance degradation of the MRSC compared to the best singleresolution code with the same distortion. For tworesolution source codes, there are three scenarios of particular interest: i) when both resolutions are equally important; ii) when the rate loss at the first resolution is 0 (
Multiresolution source coding using entropy constrained dithered scalar quantization
 In Proceedings of the Data Compression Conference
, 2004
"... In this paper, we build multiresolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for ndimensional random vectors, dithering followed by uniform scalar quantization and then by entropy coding achieves performance close to the ndimensional optimum for ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we build multiresolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for ndimensional random vectors, dithering followed by uniform scalar quantization and then by entropy coding achieves performance close to the ndimensional optimum for a multiresolution source code. Based on this result, we propose a practical code design algorithm and compare its performance with that of the Set Partitioning in Hierarchical Trees (SPIHT) algorithm on natural images. I
1 Multiple Description Coding for Stationary Gaussian Sources
"... We consider the problem of multiple description coding for stationary Gaussian sources under the squared error distortion measure. The rate region is characterized for the 2description case. It is shown that each supporting line of the rate region is achievable with a transform lattice quantization ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
We consider the problem of multiple description coding for stationary Gaussian sources under the squared error distortion measure. The rate region is characterized for the 2description case. It is shown that each supporting line of the rate region is achievable with a transform lattice quantization scheme. We show the optimal coding scheme has a natural spectral domain coding interpretation, which yields a reverse waterfilling solution with a frequencydependent water level instead of the flat water level as in the conventional single description case. Index Terms Gaussian source, lattice quantization, multiple description coding, power spectrum.
On Modeling Mismatch Errors Induced by Different Quantizers
, 2007
"... In this letter, the mismatch error due to the replacement of a fine with a coarse quantizer is considered, and an analytical model is proposed to describe the related distortion. Simulations show that this model is highly accurate and can be used to estimate the expected distortion of DPCMbased co ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
In this letter, the mismatch error due to the replacement of a fine with a coarse quantizer is considered, and an analytical model is proposed to describe the related distortion. Simulations show that this model is highly accurate and can be used to estimate the expected distortion of DPCMbased codecs in order to better allocating the rate. For highly correlated sources, this leads to a gain of 1 to 1.5 dB over an exhaustive search method that adopts a uniform redundancy allocation. Moreover, it permits to allocate the redundancy by an easytosolve analytical model of the system.
Gaussian multiple description coding with lowdensity generator matrix codes
 IEEE Trans. Commun
, 2012
"... Abstract—It is shown that the coding problem for an arbitrary point on the dominant face of an Ldescription El GamalCover (EGC) region can be converted to that for a vertex of a Kdescription EGC region for some K ≤ 2L − 1, where the latter problem can be solved via successive coding. A practical ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—It is shown that the coding problem for an arbitrary point on the dominant face of an Ldescription El GamalCover (EGC) region can be converted to that for a vertex of a Kdescription EGC region for some K ≤ 2L − 1, where the latter problem can be solved via successive coding. A practical scheme is proposed for the quadratic Gaussian case by reducing each step in successive coding to a Gaussian quantization operation and implementing such an operation using lowdensity generator matrix codes. The effectiveness of this scheme is verified through extensive simulation experiments. Index Terms—Lossy source coding, lowdensity generator matrix, messagepassing algorithm, multiple description coding, quantization splitting. I.