English
Related papers

Related papers: The Dispersion of Lossy Source Coding

200 papers

Transmission of a Gaussian source over a time-varying multiple-input multiple-output (MIMO) channel is studied under strict delay constraints. Availability of a correlated side information at the receiver is assumed, whose quality, i.e.,…

Information Theory · Computer Science 2015-05-27 Iñaki Estella Aguerri , Deniz Gündüz

In image compression, with recent advances in generative modeling, the existence of a trade-off between the rate and the perceptual quality has been brought to light, where the perception is measured by the closeness of the output…

Information Theory · Computer Science 2023-05-23 Yassine Hamdi , Deniz Gündüz

We show how real-number codes can be used to compress correlated sources, and establish a new framework for lossy distributed source coding, in which we quantize compressed sources instead of compressing quantized sources. This change in…

Information Theory · Computer Science 2012-06-20 Mojtaba Vaezi , Fabrice Labeau

An information-spectrum approach is applied to solve the multiterminal source coding problem for correlated general sources, where sources may be nonstationary and/or nonergodic, and the distortion measure is arbitrary and may be…

Information Theory · Computer Science 2007-07-13 Shengtian Yang , Peiliang Qiu

We consider the cascade and triangular rate-distortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the rate-distortion region for these problems. For the…

Information Theory · Computer Science 2010-01-12 Haim Permuter , Tsachy Weissman

This work investigates functional source coding problems with maximal distortion, motivated by approximate function computation in many modern applications. The maximal distortion treats imprecise reconstruction of a function value as good…

Information Theory · Computer Science 2022-12-29 Sourya Basu , Daewon Seo , Lav R. Varshney

We consider transmitting a source across a pair of independent, non-ergodic channels with random states (e.g., slow fading channels) so as to minimize the average distortion. The general problem is unsolved. Hence, we focus on comparing two…

Information Theory · Computer Science 2009-09-29 J. Nicholas Laneman , Emin Martinian , Gregory W. Wornell , John G. Apostolopoulos

The rate-distortion-perception function (RDPF; Blau and Michaeli, 2019) has emerged as a useful tool for thinking about realism and distortion of reconstructions in lossy compression. Unlike the rate-distortion function, however, it is…

Information Theory · Computer Science 2021-04-29 Lucas Theis , Aaron B. Wagner

The rate-distortion curve captures the fundamental tradeoff between compression length and resolution in lossy data compression. However, it conceals the underlying dynamics of optimal source encodings or test channels. We argue that these…

Information Theory · Computer Science 2023-07-03 Shlomi Agmon

A randomized covering-packing duality between source and channel coding will be discussed by considering the source coding problem of coding a source with a certain distortion level and by considering a channel which communicates the source…

Information Theory · Computer Science 2015-05-25 Mukul Agarwal , Sanjoy MItter

The variable-length source coding problem allowing the error probability up to some constant is considered for general sources. In this problem the optimum mean codeword length of variable-length codes has already been determined. On the…

Information Theory · Computer Science 2018-10-19 Ryo Nomura , Hideki Yagi

In this paper, we consider a class of multiterminal source coding problems, each subject to distortion constraints computed using a specific, entropy-based, distortion measure. We provide the achievable rate distortion region for two cases…

Information Theory · Computer Science 2011-06-02 Thomas Courtade , Richard Wesel

A new converse bound is presented for the two-user multiple-access channel under the average probability of error constraint. This bound shows that for most channels of interest, the second-order coding rate -- that is, the difference…

Information Theory · Computer Science 2021-10-04 Oliver Kosut

This paper shows that the logarithm of the epsilon-error capacity (average error probability) for n uses of a discrete memoryless channel is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2 log n +…

Information Theory · Computer Science 2013-10-25 Marco Tomamichel , Vincent Y. F. Tan

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

This paper takes a rate-distortion approach to understanding the information-theoretic laws governing cache-aided communications systems. Specifically, we characterise the optimal tradeoffs between the delivery rate, cache capacity and…

Information Theory · Computer Science 2016-10-25 Roy Timo , Shirin Saeedi Bidokhti , Michèle Wigger , Bernhard C. Geiger

We present a new technique to obtain outer-bounds on the capacity region of networks with ultra low-rate feedback. We establish a connection between the achievable rates in the forward channel and the minimum distortion that can be attained…

Information Theory · Computer Science 2021-05-11 Alireza Vahid

This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan

We improve the existing achievable rate regions for causal and for zero-delay source coding of stationary Gaussian sources under an average mean squared error (MSE) distortion measure. To begin with, we find a closed-form expression for the…

Information Theory · Computer Science 2011-05-03 Milan S. Derpich , Jan Østergaard

The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance…

Information Theory · Computer Science 2018-09-03 Lin Zhou , Vincent Y. F. Tan , Mehul Motani