English
Related papers

Related papers: Output-Constrained Lossy Source Coding With Applic…

200 papers

This paper investigates the best known bounds on the quadratic Gaussian distortion-rate-perception function with limited common randomness for the Kullback-Leibler divergence-based perception measure, as well as their counterparts for the…

Information Theory · Computer Science 2024-09-05 Li Xie , Liangyan Li , Jun Chen , Lei Yu , Zhongshan Zhang

In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding…

Information Theory · Computer Science 2011-02-15 Amir Ingber , Yuval Kochman

A distributed lossy compression network with $L$ encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean…

Information Theory · Computer Science 2022-06-06 Siyao Zhou , Sadaf Salehkalaibar , Jingjing Qian , Jun Chen , Wuxian Shi , Yiqun Ge , Wen Tong

We establish a single-letter characterization of the fundamental distortion-rate-perception tradeoff with limited common randomness under the squared error distortion measure and the squared Wasserstein-2 perception measure. Moreover, it is…

Information Theory · Computer Science 2025-04-25 Xiqiang Qu , Jun Chen , Lei Yu , Xiangyu Xu

We consider a distributed source coding problem of $L$ correlated Gaussian observations $Y_i, i=1,2,...,L$. We assume that the random vector $Y^{L}={}^{\rm t} (Y_1,Y_2,$ $...,Y_L)$ is an observation of the Gaussian random vector…

Information Theory · Computer Science 2010-01-13 Yasutada Oohama

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

Perception-aware lossy source coding has attracted significant recent interest. It augments the classical distortion criterion with an explicit perception constraint, thereby enabling more refined control over fidelity and perceptual…

Information Theory · Computer Science 2026-04-22 Ali Hussein , Jun Chen , Chao Tian , S. Sandeep Pradhan

In this paper, we study the computation of the rate-distortion-perception function (RDPF) for a multivariate Gaussian source under mean squared error (MSE) distortion and, respectively, Kullback-Leibler divergence, geometric Jensen-Shannon…

Information Theory · Computer Science 2023-11-16 Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

We consider a multiterminal source coding problem in which a source is estimated at a central processing unit from lossy-compressed remote observations. Each lossy-encoded observation is produced by a remote sensor which obtains a noisy…

Information Theory · Computer Science 2016-05-13 Ruiyang Song , Stefano Rini , Alon Kipnis , Andrea J. Goldsmith

In this paper, the rate-distortion theory of the Gray-Wyner lossy source coding system is investigated. For the case of jointly Gaussian distributed sources, we establish an expression for the rate-distortion function under the constraint…

Information Theory · Computer Science 2023-03-29 Guojun Chen , Yinfei Xu , Ling Liu , Tiecheng Song , Jing Hu

A new source model, which consists of an intrinsic state part and an extrinsic observation part, is proposed and its information-theoretic characterization, namely its rate-distortion function, is defined and analyzed. Such a source model…

Information Theory · Computer Science 2022-06-02 Jiakun Liu , Shuo Shao , Wenyi Zhang , H. Vincent Poor

The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder---to whom the side information is unavailable---be able to compute the decoder's reconstruction sequence to within some…

Information Theory · Computer Science 2016-11-15 Amos Lapidoth , Andreas Malär , Michèle Wigger

I introduce rate-distortion theory for quantum coding, and derive a lower bound, involving the coherent information, on the rate at which qubits must be used to encode a quantum source with a given maximum level of distortion per source…

Quantum Physics · Physics 2007-05-23 Howard Barnum

We consider a novel variant of $d$-semifaithful lossy coding in which the distortion measure is revealed only to the encoder and only at run-time, as well as an extension of it in which the distortion constraint $d$ is also revealed at…

Information Theory · Computer Science 2022-10-05 Adeel Mahmood , Aaron B. Wagner

For a number of lossy source coding problems it is shown that even if the usual single-letter sum-rate-distortion expressions may become invalid for non-infinite distortion functions, they can be approached, to any desired accuracy, via the…

Information Theory · Computer Science 2014-08-05 Prakash Ishwar

We study lossy source coding under a distortion measure defined by the negative log-likelihood induced by a prescribed conditional distribution $P_{X|U}$. This \emph{log-likelihood distortion} models compression settings in which the…

Information Theory · Computer Science 2026-01-26 Anuj Kumar Yadav , Dan Song , Yanina Shkel , Ayfer Özgür

We consider the distributed source coding system for $L$ correlated Gaussian observations $Y_i, i=1,2, ..., L$. Let $X_i,i=1,2, ..., L$ be $L$ correlated Gaussian random variables and $N_i,$ $i=1,2,... L$ be independent additive Gaussian…

Information Theory · Computer Science 2009-08-09 Yasutada Oohama

This paper presents a one shot analysis of the lossy compression problem under average distortion constraints. We calculate the exact expected distortion of a random code. The result is given as an integral formula using a newly defined…

Information Theory · Computer Science 2020-05-18 Nir Elkayam , Meir Feder

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ú

We consider a problem of coding for computing, where the decoder wishes to estimate a function of its local message and the source message at the encoder within a given distortion. We show that the rate-distortion function can be…

Information Theory · Computer Science 2022-05-18 Deheng Yuan , Tao Guo , Bo Bai , Wei Han
‹ Prev 1 2 3 10 Next ›