Sciweavers

72 search results - page 7 / 15
» The Dispersion of Lossy Source Coding
Sort
View
TIT
2002
129views more  TIT 2002»
14 years 9 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang
77
Voted
GLOBECOM
2008
IEEE
15 years 3 months ago
Rate Adaptive Binary Erasure Quantization with Dual Fountain Codes
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...
Dino Sejdinovic, Robert J. Piechocki, Angela Doufe...
CORR
2007
Springer
97views Education» more  CORR 2007»
14 years 9 months ago
Side-information Scalable Source Coding
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
Chao Tian, Suhas N. Diggavi
SAC
2010
ACM
15 years 4 months ago
Feature interaction networks
A quantitative approach for measuring and describing feature interactions in object-oriented software components based on source code inspection is presented. The methodical arsen...
Stefan Sobernig
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 9 months ago
Lower Bounds on the Rate-Distortion Function of LDGM Codes
Abstract-- We analyze the performance of low-density generator matrix (LDGM) codes for lossy source coding. We first develop a generic technique for deriving lower bounds on the ef...
Alexandros G. Dimakis, Martin J. Wainwright, Kanna...