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

Cited by 435 (9 self)
 Add to MetaCart
This article focuses on the compressed representations of the pictures
EntropyConstrained Successively Refinable Scalar Quantization
 Proc. IEEE Data Compression Conf
, 1997
"... We study the design of entropyconstrained successively refinable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate rate ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We study the design of entropyconstrained successively refinable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate rates. Both algorithms can be easily extended to design vector quantizers. 1 Introduction Source coding systems that are successively refinable or scalable in encoding rate have received growing attention recently. Such encoding systems have an embedded output bit stream; by selecting different substreams (stages of refinement) of the output, various levels of encoding rate and average distortion can be achieved. One immediate application of successive refinability (or, equivalently, ratescalability) , which requires an embedded output bit stream, is in progressive transmission applications. Sometimes the utility of progressive transmission is readily apparent because it is central to an appl...
On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding
"... Abstract—We clarify the relationship among several existing achievable multiple description ratedistortion regions by investigating the role of refinement layer in multiple description coding. Specifically, we show that the refinement layer in the El GamalCover (EGC) scheme and the Venkataramani–K ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
Abstract—We clarify the relationship among several existing achievable multiple description ratedistortion regions by investigating the role of refinement layer in multiple description coding. Specifically, we show that the refinement layer in the El GamalCover (EGC) scheme and the Venkataramani–Kramer–Goyal (VKG) scheme can be removed; as a consequence, the EGC region is equivalent to the EGC * region (an antecedent version of the EGC region) while the VKG region (when specialized to the 2description case) is equivalent to the Zhang–Berger (ZB) region. Moreover, we prove that for multiple description coding with individual and hierarchical distortion constraints, the number of layers in the VKG scheme can be significantly reduced when only certain weighted sum rates are concerned. The role of refinement layer in scalable coding (a special case of multiple description coding) is also studied. Index Terms—Contrapolymatroid, multiple description coding, ratedistortion region, scalable coding, successive refinement. I.
Practical MultiResolution Source Coding: TSVQ Revisited
 In Proceedings of the Data Compression Conference, pages 5362, Snowbird, UT
, 1998
"... Consider a multiresolution source code for describing a stationary source at L resolutions. The description at the first resolution is given at rate R 1 and achieves an expected distortion no greater than D 1 . The description at the second resolution includes both the first description and a refin ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Consider a multiresolution source code for describing a stationary source at L resolutions. The description at the first resolution is given at rate R 1 and achieves an expected distortion no greater than D 1 . The description at the second resolution includes both the first description and a refining description of rate R 2 and achieves expected distortion no greater than D 2 , and so on. Recently derived multiresolution source coding bounds describe the family of achievable rate and distortion vectors ((R 1 ; R 2 ; : : : ; R L ); (D 1 ; D 2 ; : : : ; D L )). By examining these multiresolution ratedistortion bounds, we gain insight into the problem of practical multiresolution source coding. These insights lead to a new multiresolution source code based on the treestructured vector quantizer. This paper covers the algorithm, its optimal design, and preliminary experimental results. I Introduction With advances in communications media and technologies come needs for communicatio...
On Source and Channel Codes for Multiple Inputs and Outputs
 Does Multiple Description Beat Space Time?, ” Information Theory Workshop
, 2004
"... Abstract — We compare two strategies for lossy source description across a pair of unreliable channels. In the first strategy, we use a broadcast channel code to achieve a different rate for each possible channel realization, and then use a multiresolution source code to describe the source at the r ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract — We compare two strategies for lossy source description across a pair of unreliable channels. In the first strategy, we use a broadcast channel code to achieve a different rate for each possible channel realization, and then use a multiresolution source code to describe the source at the resulting rates. In the second strategy, we use a channel coding strategy for two independent channels coupled with a multiple description source code. In each case, we choose the coding parameters to minimize the expected endtoend distortion in the source reconstruction. We demonstrate that in pointtopoint communication across a pair of nonergodic channels, multiple description coding can provide substantial gains relative to mulitresolution and broadcast coding. We then investigate this comparison in a simple MIMO channel. We demonstrate the inferior performance of space time coding with multiresolution source coding and broadcast channel coding relative to multiple description codes and a time sharing channel coding strategy. These results indicate that for nonergodic channels, the traditional definition of channel capacity does not necessarily lead to the best channel code from the perspective of endtoend source distortion. I.
Embedded Trellis Coded Quantization
 IEEE Data Compression Conf
, 1998
"... An embedded trellis construction technique is presented and proposed for use in Embedded Trellis Coded Quantization (ETCQ). Both fixedrate and variable rate ETCQ are developed and shown to achieve good ratedistortion performance for reasonable computational complexity. The performance of fixedr ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
An embedded trellis construction technique is presented and proposed for use in Embedded Trellis Coded Quantization (ETCQ). Both fixedrate and variable rate ETCQ are developed and shown to achieve good ratedistortion performance for reasonable computational complexity. The performance of fixedrate ETCQ is investigated for memoryless Gaussian, Laplacian, and uniform sources and shown to outperform multistage TCQ. For Gaussian and Laplacian sources the performance of fixedrate ETCQ shows large gains over the performance of scalar embedded fixedrate quantizers. In the case of a Gaussian source, the performance loss of fixedrate ETCQ compared with TCQ decreases with an increasing number of trellis states; for a large enough trellis this loss becomes negligible. Prepared through collaborative participation in the Advanced Telecommunications & Information Distribution Research Program (ATIRP) Consortium sponsored by the U.S. Army Research Laboratory under Federated Laboratory P...
Embedded EntropyConstrained Trellis Coded Quantization
 Proc., Conf. on Information Sciences and Systems
, 1998
"... A new variablerate embedded quantization technique, called Embedded EntropyConstrained Trellis Coded Quantization (EECTCQ) is developed. Its performance is compared to that of variablerate embedded scalar quantizers. Simulations indicate that performance depends both upon the number of embedded q ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
A new variablerate embedded quantization technique, called Embedded EntropyConstrained Trellis Coded Quantization (EECTCQ) is developed. Its performance is compared to that of variablerate embedded scalar quantizers. Simulations indicate that performance depends both upon the number of embedded quantization stages and the number of trellis states. 1 Introduction In many applications an embedded source code is useful. An embedded source code produces a sequence of source descriptions with the property that early descriptions are contained (embedded) within later descriptions. Each source description, except the first, may be decomposed into the prior source description and an incremental refinement. The source descriptions can be decoded by a receiver to obtain a sequence of source reconstructions with decreasing expected distortion. The goal in design of embedded source codes is to make the sequence of source descriptions efficient in a ratedistortion sense. Information theoretic ...
Successive refinement on trees: A special case of a new MD coding region
 in Proc. IEEE Data Compression Conf
, 2001
"... New achievability results for the Lstage successive refinement problem with L>2 are presented. These are derived from a recent achievability result for the more general problem of multiple description coding with L>2 channels. It is shown that successive refinability on chains implies success ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
New achievability results for the Lstage successive refinement problem with L>2 are presented. These are derived from a recent achievability result for the more general problem of multiple description coding with L>2 channels. It is shown that successive refinability on chains implies successive refinability on trees and that memoryless Gaussian sources are successively refinable on chains and trees. 1
SELECTIVE ENCRYPTION AND SCALABLE SPEECH CODING FOR VOICE COMMUNICATIONS OVER MULTIHOP WIRELESS LINKS
"... gibson,huidong,gersho§ servetti,demartin§ ..."
(Show Context)
Design of Successively Refinable Scalar Quantizers
"... The problem of successively refinable scalar quantizer design is considered. The weighted average of the expected distortion at each level of refinement is used as a quantizer figure of merit. Quantizers designed using this criterion can find application in many practical situations. Algorithms are ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The problem of successively refinable scalar quantizer design is considered. The weighted average of the expected distortion at each level of refinement is used as a quantizer figure of merit. Quantizers designed using this criterion can find application in many practical situations. Algorithms are presented for the design of both fixed and variable rate quantizers and for quantizers subject to a complexity (uniformity) constraint and for quantizers subject to no such constraint. Performance of quantizers designed using these algorithms is presented and appropriate comparisons are rendered. Index TermsEmbedded codes, successive refinement, scalar quantization. 1 Introduction Source coding systems that are successively refinable or scalable in encoding rate have received growing attention recently. Such encoding systems have an embedded output bit stream; by selecting different substreams of the output, various levels of encoding rate and distortion can be achieved. One immediate ap...