English
Related papers

Related papers: The Rate-Distortion Risk in Estimation from Compre…

200 papers

Estimating the spectral characteristics of a nonstationary random process is an important but challenging task, which can be facilitated by exploiting structural properties of the process. In certain applications, the observed processes are…

Computation · Statistics 2013-04-25 Alexander Jung , Georg Tauböck , Franz Hlawatsch

We consider a wireless node that randomly receives data from different sensor units. The arriving data must be compressed, stored, and transmitted over a wireless link, where both the compression and transmission operations consume power.…

Optimization and Control · Mathematics 2008-07-25 Michael J. Neely , Abhishek Sharma

In this paper, we propose Image Downscaling Assessment by Rate-Distortion (IDA-RD), a novel measure to quantitatively evaluate image downscaling algorithms. In contrast to image-based methods that measure the quality of downscaled images,…

Computer Vision and Pattern Recognition · Computer Science 2024-03-25 Yuanbang Liang , Bhavesh Garg , Paul L Rosin , Yipeng Qin

Statistical mechanics is applied to lossy compression using multilayer perceptrons for unbiased Boolean messages. We utilize a tree-like committee machine (committee tree) and tree-like parity machine (parity tree) whose transfer functions…

Statistical Mechanics · Physics 2007-05-23 Kazushi Mimura , Masato Okada

A rate-distortion-perception (RDP) tradeoff has recently been proposed by Blau and Michaeli and also Matsumoto. Focusing on the case of perfect realism, which coincides with the problem of distribution-preserving lossy compression studied…

Information Theory · Computer Science 2022-02-10 Aaron B. Wagner

We introduce a new protocol for a lossy data compression algorithm which is based on constraint satisfaction gates. We show that the theoretical capacity of algorithms built from standard parity-check gates converges exponentially fast to…

Disordered Systems and Neural Networks · Physics 2009-11-11 S. Ciliberti , M. Mezard , R. Zecchina

In rate-distortion (RD) problems one seeks reduced representations of a source that meet a target distortion constraint. Such optimal representations undergo topological transitions at some critical rate values, when their cardinality or…

Information Theory · Computer Science 2023-10-09 Shlomi Agmon , Etam Benger , Or Ordentlich , Naftali Tishby

Many state-of-the-art neural network-based source separation systems use the averaged Signal-to-Distortion Ratio (SDR) as a training objective function. The basic SDR is, however, undefined if the network reconstructs the reference signal…

Audio and Speech Processing · Electrical Eng. & Systems 2022-04-22 Thilo von Neumann , Keisuke Kinoshita , Christoph Boeddeker , Marc Delcroix , Reinhold Haeb-Umbach

Despite recent advancements in packet loss concealment (PLC) using deep learning techniques, packet loss remains a significant challenge in real-time speech communication. Redundancy has been used in the past to recover the missing…

Audio and Speech Processing · Electrical Eng. & Systems 2024-10-28 Jean-Marc Valin , Jan Büthe , Ahmed Mustafa , Michael Klingbeil

One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper…

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

Deep learning-based image compression algorithms typically focus on designing encoding and decoding networks and improving the accuracy of entropy model estimation to enhance the rate-distortion (RD) performance. However, few algorithms…

Image and Video Processing · Electrical Eng. & Systems 2024-10-08 Junhui Li , Jutao Li , Xingsong Hou , Huake Wang

We introduce sparse random projection, an important dimension-reduction tool from machine learning, for the estimation of discrete-choice models with high-dimensional choice sets. Initially, high-dimensional data are compressed into a…

Machine Learning · Statistics 2016-04-21 Khai X. Chiong , Matthew Shum

We establish the first information-theoretic limits for multimodal retrieval. Casting ranking as lossy source coding, we derive a single-letter rate-distortion function $R(D)$ for reciprocal-rank distortion and prove a converse bound that…

Information Theory · Computer Science 2025-09-16 Thomas Y. Chen

This paper investigates a lossy source coding problem in which two decoders can access their side-information respectively. The correlated sources are a product of two component correlated sources, and we exclusively investigate the case…

Information Theory · Computer Science 2013-05-29 Shun Watanabe

In this paper we consider the rate distortion problem of discrete-time, ergodic, and stationary sources with feed forward at the receiver. We derive a sequence of achievable and computable rates that converge to the feed-forward rate…

Information Theory · Computer Science 2011-06-07 Iddo Naiss , Haim Permuter

We consider the distributional connection between the lossy compressed representation of a high-dimensional signal $X$ using a random spherical code and the observation of $X$ under an additive white Gaussian noise (AWGN). We show that the…

Information Theory · Computer Science 2021-12-14 Alon Kipnis , Galen Reeves

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

In this paper, we investigate the rate-distortion-perception function (RDPF) of a source modeled by a Gaussian Process (GP) on a measure space $\Omega$ under mean squared error (MSE) distortion and squared Wasserstein-2 perception metrics.…

Information Theory · Computer Science 2025-01-14 Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

This paper studies the Shannon regime for the random displacement of stationary point processes. Let each point of some initial stationary point process in $\R^n$ give rise to one daughter point, the location of which is obtained by adding…

Information Theory · Computer Science 2015-03-17 Venkat Anantharam , Francois Baccelli

This paper establishes the theoretical limits of channel state information (CSI) feedback in frequency-division duplexing (FDD) multi-antenna orthogonal frequency-division multiplexing (OFDM) systems under finite-length training with…

Information Theory · Computer Science 2026-02-09 Shuao Chen , Junyuan Gao , Yuxuan Shi , Yongpeng Wu , Giuseppe Caire , H. Vincent Poor , Wenjun Zhang
‹ Prev 1 8 9 10 Next ›