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

Cited by 334 (8 self)
 Add to MetaCart
This article focuses on the compressed representations of the pictures
DomainBased Multiple Description Coding of Images Video
"... In this paper we present a method of creating domainbased multiple descriptions of images and video. Descriptions are created by partitioning the domain of the signal into sets whose points are maximally separated from each other. This property enables simple error concealment methods to produce go ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
(Show Context)
In this paper we present a method of creating domainbased multiple descriptions of images and video. Descriptions are created by partitioning the domain of the signal into sets whose points are maximally separated from each other. This property enables simple error concealment methods to produce good estimates of lost signal samples. We present the approach in the context of Internet transmission of subbandcoded images and scalable motion compensated 3D subbandcoded video, but applications are not limited to these scenarios.
Asymptotic Performance of Multiple Description Lattice Quantizers
, 2000
"... The highrate squarederror distortions of a balanced multiple description lattice vector quantizer are analyzed for a memoryless source with probability density function p, differential entropy h(p) ! 1, and lattice codebook . For any a 2 (0; 1) and rate pair (R; R), it is shown that the twochann ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
(Show Context)
The highrate squarederror distortions of a balanced multiple description lattice vector quantizer are analyzed for a memoryless source with probability density function p, differential entropy h(p) ! 1, and lattice codebook . For any a 2 (0; 1) and rate pair (R; R), it is shown that the twochannel distortion d0 and the channel 1 (or channel 2) distortion ds satisfy lim R!1 d02 2R(1+a) = G()2 2h(p) =4 and lim R!1 ds2 2R(1\Gammaa) = G(SL)2 2h(p) ; where G() is the normalized second moment of a Voronoi cell of the lattice and G(SL) is the normalized second moment of a sphere in L dimensions. I. Introduction We consider a twochannel multiple description quantization system for a discretememoryless source with differential entropy h(p). The quantizer transmits information on each channel at rate R bits/sample. The meansquared error when both channels work is denoted by d0 and when either channel works is denoted by ds . It has been shown [1] that for a un...
Supporting Image/Video Applications in a Mobile Multihop Radio Environment Using Route Diversity and Multiple Description Coding
 IEEE Trans. CSVT
"... This paper motivates the need for Multiple Path Transport #MPT# of video and image information in a multihop mobile radio network. The video and image information is encoded nonhierarchically into multiple descriptions #MDC# with the following objectives. The received picture quality should be acce ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
This paper motivates the need for Multiple Path Transport #MPT# of video and image information in a multihop mobile radio network. The video and image information is encoded nonhierarchically into multiple descriptions #MDC# with the following objectives. The received picture quality should be acceptable even if only one description is received and every additionally received description contributes to enhanced picture quality.Typical applications will need a higher bandwidth#higher reliability connection than that provided by current mobile networks. For supporting these applications a mobile node may need to set up and use multiple paths to the desired destination, either simply because of the lackofraw bandwidth on a single channel or because of its poor error characteristics, which reduces its e#ective throughput. In the context of this work, the principal reasons for considering suchanarchitecture are providing high bandwidth and more robust endtoend connections. We describe a protocol architecture that addresses this need and, with the help of simulations, we demonstrate the feasibilityofthis system and compare the performance of the MDCMPT scheme to that of a hierarchical coding scheme.
Efficient reconstruction from framebased multiple descriptions
 IEEE Trans. Signal Process
, 2005
"... Abstract—Redundant bases or frames are a promising technique for multiple description signal coding. Frames can provide sufficient redundancy for recovery in case of coefficient losses due, for instance, to packet transmission errors. In this paper, we consider the problem of dual frame computation ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract—Redundant bases or frames are a promising technique for multiple description signal coding. Frames can provide sufficient redundancy for recovery in case of coefficient losses due, for instance, to packet transmission errors. In this paper, we consider the problem of dual frame computation in the context of finite impulse response (FIR) analysis and synthesis filterbanks. In particular, we propose an algorithm for dual frame computation which recovers the missing frame coefficients, followed by synthesis with the original filterbank. It is shown that the algorithm operates locally and allows for reduced complexity and lowdelay reconstruction of the original signal. The case of excessive losses and incomplete bases is also considered. Experiments are provided to evaluate the algorithm performance and test its applicability in practical contexts. Index Terms—Algorithms, Hilbert spaces, MIMO systems, multimedia communications, multiple descriptions, redundant filterbanks, source coding. I.
Speech Coding for Mobile Ad hoc Networks
 in Proceedings of the Asilomar Conference on Signals, Systems, and Computers
, 2003
"... Computer ..."
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 4 (1 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.
Optimal Index Assignment for Multichannel Communication
 In Proc. SIAM Symp. Discrete Algorithms
, 1998
"... . We consider the problem of communication over multiple channels in which channels can fail and the information sent over those channels is lost. The goal is to recover as much of the original information as possible while having as little redundancy as possible. The information is encoded into an ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
. We consider the problem of communication over multiple channels in which channels can fail and the information sent over those channels is lost. The goal is to recover as much of the original information as possible while having as little redundancy as possible. The information is encoded into an ordered tuple of indices, each component of which is sent over a separate channel. We analyze the problem of designing an encoding that minimizes the decoding error in case of channel failure, give tight lower bounds and optimal algorithms in the case of two channels, and generalize the results to arbitrary number of channels. Key words. Multichannel communication, diversity systems, quantization, source coding, multiple descriptions, index assignment, algorithm design. AMS(MOS) subject classifications. 94A05, 94A24, 94A40, 68Q25 1 Introduction Consider sending lg m bits of information over k independent channels. We want to partition the lg m bits into k subsets so that if all k subsets...
Multiple Description Coding with Redundant Expansions and Application to Image Communications
, 2007
"... Multiple description coding offers an elegant and competitive solution for data transmission over lossy packetbased networks, with a graceful degradation in quality as losses increase. In the same time, coding techniques based on redundant transforms give a very promising alternative for the genera ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Multiple description coding offers an elegant and competitive solution for data transmission over lossy packetbased networks, with a graceful degradation in quality as losses increase. In the same time, coding techniques based on redundant transforms give a very promising alternative for the generation of multiple descriptions, mainly due to redundancy inherently given by a transform, which offers intrinsic resiliency in case of loss. In this paper, we show how partitioning of a generic redundant dictionary can be used to obtain an arbitrary number of multiple complementary, yet correlated, descriptions. The most significant terms in the signal representation are drawn from the partitions that better approximate the signal, and split to different descriptions, while the less important ones are alternatively distributed between the descriptions. As compared to stateoftheart solutions, such a strategy allows for a better central distortion since atoms in different descriptions are not identical; in the same time, it does not penalize the side distortions significantly since atoms from the same partition are likely to be highly correlated. The proposed scheme is applied to the multiple description coding of digital images, and simulation results show increased performances compared to stateoftheart schemes, both in terms of distortions and robustness to loss rate variations.