English
Related papers

Related papers: Rate-distortion function via minimum mean square e…

200 papers

For a Gaussian source under mean-squared error (MSE), classical transform coding is rate--distortion (RD) optimal: the Karhunen--Loeve transform (KLT) diagonalizes the covariance, reverse waterfilling allocates the bits, and scalar…

Information Theory · Computer Science 2026-05-18 Bumsu Park , Chanho Park , Youngmok Park , Namyoon Lee

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

A two-terminal interactive function computation problem with alternating messages is studied within the framework of distributed block source coding theory. For any finite number of messages, a single-letter characterization of the…

Information Theory · Computer Science 2012-08-06 Nan Ma , Prakash Ishwar

We revisit the source image estimation problem from blind source separation (BSS). We generalize the traditional minimum distortion principle to maximum likelihood estimation with a model for the residual spectrograms. Because residual…

Audio and Speech Processing · Electrical Eng. & Systems 2020-09-14 Robin Scheibler

Rate distortion dimension describes the theoretical limit of lossy data compression methods as the distortion bound goes to zero. It was originally introduced in the context of information theory, and recently it was discovered that it has…

Dynamical Systems · Mathematics 2025-03-11 Masaki Tsukamoto

We extend quantum rate distortion theory by considering auxiliary resources that might be available to a sender and receiver performing lossy quantum data compression. The first setting we consider is that of quantum rate distortion coding…

Quantum Physics · Physics 2013-12-09 Mark M. Wilde , Nilanjana Datta , Min-Hsiu Hsieh , Andreas Winter

In this paper, we consider a distributed remote source coding problem, where a sequence of observations of source vectors is available at the encoder. The problem is to specify the optimal rate for encoding the observations subject to a…

Information Theory · Computer Science 2014-06-05 Adel Zahedi , Jan Ostergaard , Soren Holdt Jensen , Patrick Naylor , Soren Bech

An asymptotic technique is presented to characterize the bits/symbol achievable on a representative wireless link in a spatially distributed network with active interferers at correlated positions, N receive diversity branches, and linear…

Information Theory · Computer Science 2013-12-30 Siddhartan Govindasamy

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

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

Minimum mean square error (MMSE) estimation of block sparse signals from noisy linear measurements is considered. Unlike in the standard compressive sensing setup where the non-zero entries of the signal are independently and uniformly…

Information Theory · Computer Science 2012-04-26 Mikko Vehkaperä , Saikat Chatterjee , Mikael Skoglund

This paper considers lossy source coding of $n$-dimensional memoryless sources and shows an explicit approximation to the minimum source coding rate required to sustain the probability of exceeding distortion $d$ no greater than $\epsilon$,…

Information Theory · Computer Science 2017-02-28 Victoria Kostina

We consider the rate distortion problem with side information at the decoder posed and investigated by Wyner and Ziv. The rate distortion function indicating the trade-off between the rate on the data compression and the quality of data…

Information Theory · Computer Science 2016-04-27 Yasutada Oohama

We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be…

Information Theory · Computer Science 2019-04-09 Lan V. Truong , Vincent Y. F. Tan

Living organisms rely on internal models of the world to act adaptively. These models, because of resource limitations, cannot encode every detail and hence need to compress information. From a cognitive standpoint, information compression…

Neurons and Cognition · Quantitative Biology 2025-02-18 Leo D'Amato , Gian Luca Lancia , Giovanni Pezzulo

In this work, we investigate an instance of the Heegard-Berger problem with two sources and arbitrarily correlated side information sequences at two decoders, in which the reconstruction sets at the decoders are degraded. Specifically, two…

Information Theory · Computer Science 2015-08-27 Meryem Benammar , Abdellatif Zaidi

We consider causal, low-latency, sequential lossy compression, with mean squared-error (MSE) as the distortion loss, and a perception loss function (PLF) to enhance the realism of reconstructions. As the main contribution, we propose and…

Machine Learning · Computer Science 2025-02-18 Sadaf Salehkalaibar , Buu Phan , Likun Cai , Joao Atz Dick , Wei Yu , Jun Chen , Ashish Khisti

This paper quantifies the fundamental limits of variable-length transmission of a general (possibly analog) source over a memoryless channel with noiseless feedback, under a distortion constraint. We consider excess distortion, average…

Information Theory · Computer Science 2017-02-28 Victoria Kostina , Yury Polyanskiy , Sergio Verdú

We study the compression of data in the case where the useful information is contained in a set rather than a vector, i.e., the ordering of the data points is irrelevant and the number of data points is unknown. Our analysis is based on…

Information Theory · Computer Science 2018-05-23 Günther Koliander , Dominic Schuhmacher , Franz Hlawatsch

We consider the recovery of a continuous-time Wiener process from a quantized or lossy compressed version of its uniform samples under limited bitrate and sampling rate. We derive a closed form expression for the optimal tradeoff among…

Information Theory · Computer Science 2018-07-27 Alon Kipnis , Andrea J. Goldsmith , Yonina C. Eldar