Results 1  10
of
21
Multiple Description Coding: Compression Meets the Network
, 2001
"... This article focuses on the compressed representations of the pictures ..."
Abstract

Cited by 433 (9 self)
 Add to MetaCart
This article focuses on the compressed representations of the pictures
Lossy Source Coding
 IEEE Trans. Inform. Theory
, 1998
"... Lossy coding of speech, highquality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called ratedistortion theory. For the first 25 year ..."
Abstract

Cited by 103 (1 self)
 Add to MetaCart
(Show Context)
Lossy coding of speech, highquality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called ratedistortion theory. For the first 25 years of its existence, ratedistortion theory had relatively little impact on the methods and systems actually used to compress real sources. Today, however, ratedistortion theoretic concepts are an important component of many lossy compression techniques and standards. We chronicle the development of ratedistortion theory and provide an overview of its influence on the practice of lossy source coding. Index TermsData compression, image coding, speech coding, rate distortion theory, signal coding, source coding with a fidelity criterion, video coding. I.
Multiple Description Coding with Many Channels
 IEEE TRANS. INFORM. THEORY
, 2003
"... An achievable region for thechannel multiple description coding problem is presented. This region generalizes twochannel results of El Gamal and Cover and of Zhang and Berger. It further generalizes threechannel results of Gray and Wyner and of Zhang and Berger. A source that is successively refi ..."
Abstract

Cited by 73 (1 self)
 Add to MetaCart
(Show Context)
An achievable region for thechannel multiple description coding problem is presented. This region generalizes twochannel results of El Gamal and Cover and of Zhang and Berger. It further generalizes threechannel results of Gray and Wyner and of Zhang and Berger. A source that is successively refinable on chains is shown to be successively refinable on trees. A new outer bound on the ratedistortion (RD) region for memoryless Gaussian sources with mean squared error distortion is also derived. The achievable region meets this outer bound for certain symmetric cases.
The RateDistortion Region for Multiple Descriptions without Excess Rate
 IEEE Trans. Inform. Theory
, 1985
"... During recent years there has been strong interest in a certain source coding problem, which some authors call the "problem of multiple descriptions". Old and new wringing techniques enable us to establish a singleletter characterization of the ratedistrotion region in the case of no e ..."
Abstract

Cited by 62 (1 self)
 Add to MetaCart
During recent years there has been strong interest in a certain source coding problem, which some authors call the "problem of multiple descriptions". Old and new wringing techniques enable us to establish a singleletter characterization of the ratedistrotion region in the case of no excess rate for the joint description. 1 The Result Since the origin of the problem of multiple descriptiona and motivations for its study have already been described in an extensive literature [1][9], we present our result immediately. It goes considerably beyond those of [17], where the reader also will find a detailed discussion of previously known results. We are given the following. 1) A sequence (X t ) 1 t=1 of independent and identically distributed random variables with values in a finite set X , that is, a discrete memoryless source (DMS). 2) Three finite reconstruction spaces X 0 , X 1 , and X 2 , together with associated per letter distortion measures d i : X \Theta X i ! R ...
Sourcechannel diversity for parallel channels
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2005
"... We consider transmitting a source across a pair of independent, nonergodic channels with random states (e.g., slowfading channels) so as to minimize the average distortion. The general problem is unsolved. Hence, we focus on comparing two commonly used source and channel encoding systems which corr ..."
Abstract

Cited by 49 (5 self)
 Add to MetaCart
(Show Context)
We consider transmitting a source across a pair of independent, nonergodic channels with random states (e.g., slowfading channels) so as to minimize the average distortion. The general problem is unsolved. Hence, we focus on comparing two commonly used source and channel encoding systems which correspond to exploiting diversity either at the physical layer through parallel channel coding or at the application layer through multiple description (MD) source coding. For on–off channel models, source coding diversity offers better performance. For channels with a continuous range of reception quality, we show the reverse is true. Specifically, we introduce a new figure of merit called the distortion exponent which measures how fast the average distortion decays with signaltonoise ratio. For continuousstate models such as additive white Gaussian noise (AWGN) channels with multiplicative Rayleigh fading, optimal channel coding diversity at the physical layer is more efficient than source coding diversity at the application layer in that the former achieves a better distortion exponent. Finally, we consider a third decoding architecture: MD encoding with joint source–channel decoding. We show that this architecture achieves the same distortion exponent as systems with optimal channel coding diversity for continuousstate channels, and maintains the advantages of MD systems for on–off channels. Thus, the MD system with joint decoding achieves the best performance from among the three architectures considered, on both continuousstate and on–off channels.
Asymptotic Analysis of Multiple Description Quantizers
 IEEE Trans. Inform. Theory
, 1998
"... A high rate analysis is presented for multiple description quantizers introduced in [1], for rth power distortions and general source densities. Both, fixed length and variable length encoding of the quantizer indices are considered. Optimal companding functions are shown to be the same as for singl ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
(Show Context)
A high rate analysis is presented for multiple description quantizers introduced in [1], for rth power distortions and general source densities. Both, fixed length and variable length encoding of the quantizer indices are considered. Optimal companding functions are shown to be the same as for single channel quantizers. As compared to the bound in [2], a gap of 8.69 dB and 3.07 dB exists between the entropyconstrained and levelconstrained cases, respectively, for a memoryless Gaussian source and r = 2, Index terms: Source Coding, Quantization, Data Compression, Multiple Descriptions, Diversity Systems. This work was was presented in part at the 1994 IEEE International Symposium on Information Theory, Trondheim, Norway, and was supported by grants NSF NCR9104566 and NSF NCR9314221. This work was performed while the first author was at Texas A&M University. 1 I Introduction We present an asymptotic analysis of multiple description scalar quantizers (MDSQ's), introduced in [1] fo...
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 28 (11 self)
 Add to MetaCart
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