English
Related papers

Related papers: Indirect Rate Distortion Functions with Side Infor…

200 papers

We consider a secure source coding problem with side information (S.I.) at the decoder and the eavesdropper. The encoder has a source that it wishes to describe with limited distortion through a rate limited link to a legitimate decoder.…

Information Theory · Computer Science 2013-07-04 Yeow-Khiang Chia , Kittipong Kittichokechai

This paper studies the rate-distortion-perception (RDP) tradeoff for a Gaussian vector source coding problem where the goal is to compress the multi-component source subject to distortion and perception constraints. Specifically, the RDP…

Information Theory · Computer Science 2025-03-18 Jingjing Qian , Sadaf Salehkalaibar , Jun Chen , Ashish Khisti , Wei Yu , Wuxian Shi , Yiqun Ge , Wen Tong

For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three…

Information Theory · Computer Science 2016-11-18 Behzad Ahmadi , Ravi Tandon , Osvaldo Simeone , H. Vincent Poor

We introduce the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. We show that such distortion side information is not only useful at the encoder, but that under…

Information Theory · Computer Science 2007-07-16 Emin Martinian , Gregory W. Wornell , Ram Zamir

A lossy source coding problem is studied in which a source encoder communicates with two decoders, one with and one without correlated side information with an additional constraint on the privacy of the side information at the uninformed…

Information Theory · Computer Science 2011-06-13 Ravi Tandon , Lalitha Sankar , H. Vincent Poor

We investigate the Wyner-Ziv coding in which the statistics of the principal source is known but the statistics of the channel generating the side-information is unknown except that it is in a certain class. The class consists of channels…

Information Theory · Computer Science 2013-05-06 Shun Watanabe , Shigeaki Kuzuoka

The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida

We prove achievability of the recently characterized quadratic Gaussian rate-distortion function (RDF) subject to the constraint that the distortion is uncorrelated to the source. This result is based on shaped dithered lattice quantization…

Information Theory · Computer Science 2008-07-24 Milan S. Derpich , Jan Ostergaard , Daniel E. Quevedo

This paper investigates a unification of distributed source coding, multiple description coding, and source coding with side information at decoders. The equivalence between the multiple-decoder extension of distributed source coding with…

Information Theory · Computer Science 2024-10-28 Jun Muramatsu

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

Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear…

Information Theory · Computer Science 2007-07-25 D. Krithivasan , S. S. Pradhan

We consider a source coding problem with a network scenario in mind, and formulate it as a remote vector Gaussian Wyner-Ziv problem under covariance matrix distortions. We define a notion of minimum for two positive-definite matrices based…

Information Theory · Computer Science 2016-11-03 Adel Zahedi , Jan Østergaard , Søren Holdt Jensen , Patrick A. Naylor , Søren Bech

The "water-filling" solution for the quadratic rate-distortion function of a stationary Gaussian source is given in terms of its power spectrum. This formula naturally lends itself to a frequency domain "test-channel" realization. We…

Information Theory · Computer Science 2008-02-18 Ram Zamir , Yuval Kochman , Uri Erez

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

Information Theory · Computer Science 2025-07-22 Yassine Hamdi , Aaron B. Wagner , Deniz Gündüz

Let (S1,i, S2,i), distributed according to i.i.d p(s1, s2), i = 1, 2, . . . be a memoryless, correlated partial side information sequence. In this work we study channel coding and source coding problems where the partial side information…

Information Theory · Computer Science 2013-04-12 Avihay Shirazi , Uria Basher , Haim Permuter

We study strategic Gaussian semantic compression under rate and compute constraints, where an encoder and decoder optimize distinct quadratic objectives. A latent Gaussian state generates a task dependent semantic variable, and the decoder…

Information Theory · Computer Science 2026-02-05 Emrah Akyol

In this paper the multicasting of independent parallel Gaussian sources over a binary erasure broadcasted channel is considered. Multiresolution embedded quantizer and layered joint source-channel coding schemes are used in order to serve…

Information Theory · Computer Science 2009-01-19 Ozgun Y. Bursalioglu , Maria Fresia , Giuseppe Caire , H. Vincent Poor

The recently proposed set-up of source coding with a side information "vending machine" allows the decoder to select actions in order to control the quality of the side information. The actions can depend on the message received from the…

Information Theory · Computer Science 2013-01-08 Osvaldo Simeone

We present a Deep Image Compression neural network that relies on side information, which is only available to the decoder. We base our algorithm on the assumption that the image available to the encoder and the image available to the…

Computer Vision and Pattern Recognition · Computer Science 2020-07-30 Sharon Ayzik , Shai Avidan

Fundamental rate-distortion-perception (RDP) trade-offs arise in applications requiring maintained perceptual quality of reconstructed data, such as neural image compression. When compressed data is transmitted over public communication…

Information Theory · Computer Science 2026-04-23 Gustaf Åhlgren , Onur Günlü