English
Related papers

Related papers: A Rate-Distortion Analysis for Composite Sources U…

200 papers

In rate-distortion (RD) problems one seeks reduced representations of a source that meet a target distortion constraint. Such optimal representations undergo topological transitions at some critical rate values, when their cardinality or…

Information Theory · Computer Science 2023-10-09 Shlomi Agmon , Etam Benger , Or Ordentlich , Naftali Tishby

Since the publication of Shannon's theory of one terminal source coding, a number of interesting extensions have been derived by researchers such as Slepian-Wolf, Wyner, Ahlswede-K\"{o}rner, Wyner-Ziv and Berger-Yeung. Specifically, the…

Information Theory · Computer Science 2007-07-13 Soumya Jana

A receiver wants to compute a function of two correlated sources separately observed by two transmitters. One of the transmitters may send a possibly private message to the other transmitter in a cooperation phase before both transmitters…

Information Theory · Computer Science 2015-04-08 Milad Sefidgaran , Aslan Tchamkerten

We formulate quantum rate-distortion theory in the most general setting where classical side information is included in the tradeoff. Using a natural distortion measure based on entanglement fidelity and specializing to the case of an…

Quantum Physics · Physics 2009-09-25 Igor Devetak , Toby Berger

We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…

Information Theory · Computer Science 2021-09-29 Neri Merhav

Storage systems have a strong need for substantially improving their error correction capabilities, especially for long-term storage where the accumulating errors can exceed the decoding threshold of error-correcting codes (ECCs). In this…

Information Theory · Computer Science 2018-11-12 Pulakesh Upadhyaya , Anxiao , Jiang

Most existing sequence labelling models rely on a fixed decomposition of a target sequence into a sequence of basic units. These methods suffer from two major drawbacks: 1) the set of basic units is fixed, such as the set of words,…

Computation and Language · Computer Science 2017-08-15 Hairong Liu , Zhenyao Zhu , Xiangang Li , Sanjeev Satheesh

In this paper, we study the asymptotic performance of Abelian group codes for the lossy source coding problem for arbitrary discrete (finite alphabet) memoryless sources as well as the channel coding problem for arbitrary discrete (finite…

Information Theory · Computer Science 2013-05-08 Aria G. Sahebi , S. Sandeep Pradhan

Motion compensated prediction is central to the efficiency of video compression. Its predictive coding scheme propagates the quantization distortion through the prediction chain and creates a temporal dependency. Prior research typically…

Image and Video Processing · Electrical Eng. & Systems 2021-08-27 Jingning Han , Paul Wilkins , Yaowu Xu , James Bankoski

Predictive coding is attractive for compression onboard of spacecrafts thanks to its low computational complexity, modest memory requirements and the ability to accurately control quality on a pixel-by-pixel basis. Traditionally, predictive…

Information Theory · Computer Science 2014-01-15 Diego Valsesia , Enrico Magli

Focal loss has recently gained significant popularity, particularly in tasks like object detection where it helps to address class imbalance by focusing more on hard-to-classify examples. This work proposes the focal loss as a distortion…

Information Theory · Computer Science 2025-04-29 Alex Dytso , Martina Cardone

End-to-end learned video compression has achieved strong rate-distortion performance, but rate control remains underexplored, especially in target-bitrate-driven and budget-constrained scenarios. Existing methods mainly rely on explicit…

Multimedia · Computer Science 2026-04-23 Zhiheng Xu , Xuerui Ma , Chunhua Peng , Hao Zhang

Rate-distortion (R-D) function, a key quantity in information theory, characterizes the fundamental limit of how much a data source can be compressed subject to a fidelity criterion, by any compression algorithm. As researchers push for…

Information Theory · Computer Science 2022-03-14 Yibo Yang , Stephan Mandt

Motivated by the need for communication-efficient distributed learning, we investigate the method for compressing a unit norm vector into the minimum number of bits, while still allowing for some acceptable level of distortion in recovery.…

Information Theory · Computer Science 2024-02-06 Heng Zhu , Avishek Ghosh , Arya Mazumdar

This paper studies the minimum achievable source coding rate as a function of blocklength $n$ and probability $\epsilon$ that the distortion exceeds a given level $d$. Tight general achievability and converse bounds are derived that hold at…

Information Theory · Computer Science 2016-11-15 Victoria Kostina , Sergio Verdú

This paper proves the separation between source-network coding and channel coding in networks of noisy, discrete, memoryless channels. We show that the set of achievable distortion matrices in delivering a family of dependent sources across…

Information Theory · Computer Science 2016-11-17 Shirin Jalali , Michelle Effros

In this paper, delay-limited transmission of quasi-stationary sources over block fading channels are considered. Considering distortion outage probability as the performance measure, two source and channel coding schemes with power adaptive…

Information Theory · Computer Science 2012-02-29 Roghayeh Joda , Farshad Lahouti

We establish the first information-theoretic limits for multimodal retrieval. Casting ranking as lossy source coding, we derive a single-letter rate-distortion function $R(D)$ for reciprocal-rank distortion and prove a converse bound that…

Information Theory · Computer Science 2025-09-16 Thomas Y. Chen

Blau and Michaeli recently introduced a novel concept for inverse problems of signal processing, that is, the perception-distortion tradeoff. We introduce their tradeoff into the rate distortion theory of variable-length lossy source coding…

Information Theory · Computer Science 2019-02-12 Ryutaroh Matsumoto

Representing a continuous-time signal by a set of samples is a classical problem in signal processing. We study this problem under the additional constraint that the samples are quantized or compressed in a lossy manner under a limited…

Information Theory · Computer Science 2018-04-12 Alon Kipnis , Yonina C. Eldar , Andrea J. Goldsmith
‹ Prev 1 8 9 10 Next ›