English
Related papers

Related papers: Nonanticipative Rate Distortion Function for Gener…

200 papers

The problem of estimating the information rate distortion perception function (RDPF), which is a relevant information-theoretic quantity in goal-oriented lossy compression and semantic information reconstruction, is investigated here.…

Information Theory · Computer Science 2025-09-25 Martha V. Sourla , Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

In this study we consider rateless coding over discrete memoryless channels (DMC) with feedback. Unlike traditional fixed-rate codes, in rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level…

Information Theory · Computer Science 2012-01-30 Navot Blits

In this paper, we develop {finite-time horizon} causal filters using the nonanticipative rate distortion theory. We apply the {developed} theory to {design optimal filters for} time-varying multidimensional Gauss-Markov processes, subject…

Information Theory · Computer Science 2017-02-13 Photios A. Stavrou , Themistoklis Charalambous , Charalambos D. Charalambous , Sergey Loyka

The rate-distortion-perception (RDP) tradeoff characterizes the fundamental limits of lossy compression by jointly considering bitrate, reconstruction fidelity, and perceptual quality. While recent neural compression methods have improved…

Information Theory · Computer Science 2026-05-25 Yuhan Wang , Suzhi Bi , Ying-Jun Angela Zhang

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

With the increasing number of images and videos consumed by computer vision algorithms, compression methods are evolving to consider both perceptual quality and performance in downstream tasks. Traditional codecs can tackle this problem by…

Image and Video Processing · Electrical Eng. & Systems 2024-08-14 Samuel Fernández Menduiña , Eduardo Pavez , Antonio Ortega

The rate-distortion performance of neural image compression models has exceeded the state-of-the-art for non-learned codecs, but neural codecs are still far from widespread deployment and adoption. The largest obstacle is having efficient…

Computer Vision and Pattern Recognition · Computer Science 2023-11-23 David Minnen , Nick Johnston

The relation between rate distortion function (RDF) and Bayesian filtering theory is discussed. The relation is established by imposing a causal or realizability constraint on the reconstruction conditional distribution of the RDF, leading…

Information Theory · Computer Science 2012-04-16 Photios A. Stavrou , Charalambos D. Charalambous , Christos K. Kourtellaris

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

The fundamental limit of natural signal compression has traditionally been characterized by classical rate-distortion (RD) theory through the tradeoff between coding rate and reconstruction distortion, while the rate-distortion-perception…

Information Theory · Computer Science 2026-04-17 Zijian Liang , Kai Niu , Changshuo Wang , Jin Xu , Ping Zhang

A composite source, consisting of multiple subsources and a memoryless switch, outputs one symbol at a time from the subsource selected by the switch. If some data should be encoded more accurately than other data from an information…

Information Theory · Computer Science 2024-11-14 Jiakun Liu , H. Vincent Poor , Iickho Song , Wenyi Zhang

Shaping codes are used to encode information for use on channels with cost constraints. Applications include data transmission with a power constraint and, more recently, data storage on flash memories with a constraint on memory cell wear.…

Information Theory · Computer Science 2020-01-10 Yi Liu , Pengfei Huang , Alexander W. Bergman , Paul H. Siegel

In the context of lossy compression, Blau & Michaeli (2019) adopt a mathematical notion of perceptual quality and define the information rate-distortion-perception function, generalizing the classical rate-distortion tradeoff. We consider…

Information Theory · Computer Science 2021-12-23 George Zhang , Jingjing Qian , Jun Chen , Ashish Khisti

The additive rate-distortion function (ARDF) was developed in order to universally bound the rate loss in the Wyner-Ziv problem, and has since then been instrumental in e.g., bounding the rate loss in successive refinements, universal…

Information Theory · Computer Science 2011-05-26 Jan Ostergaard , Ram Zamir

One key requirement for fountain (rateless) coding schemes is to achieve a high intermediate symbol recovery rate. Recent coding schemes have incorporated the use of a feedback channel to improve intermediate performance of traditional…

Information Theory · Computer Science 2016-11-17 Morteza Hashemi , Yuval Cassuto , Ari Trachtenberg

Recent advances in machine learning-aided lossy compression are incorporating perceptual fidelity into the rate-distortion theory. In this paper, we study the rate-distortion-perception trade-off when the perceptual quality is measured by…

Information Theory · Computer Science 2023-05-23 Xueyan Niu , Deniz Gündüz , Bo Bai , Wei Han

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

In lossy compression, Blau and Michaeli [5] introduced the information rate-distortion-perception (RDP) function, extending traditional rate-distortion theory by incorporating perceptual quality. More recently, this framework was expanded…

Information Theory · Computer Science 2025-04-15 Nam Nguyen , Thinh Nguyen , Bella Bose

Let $X^n\in\mathcal{X}^n$ be a sequence drawn from a discrete memoryless source, and let $Y^n\in\mathcal{Y}^n$ be the corresponding reconstruction sequence that is output by a good rate-distortion code. This paper establishes a property of…

Information Theory · Computer Science 2013-07-31 Curt Schieler , Paul Cuff

Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory, as proposed previously by the authors, currently provides…

Information Theory · Computer Science 2016-11-17 Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan