English
Related papers

Related papers: The Time-Invariant Multidimensional Gaussian Seque…

200 papers

We derive a simple general parametric representation of the rate-distortion function of a memoryless source, where both the rate and the distortion are given by integrals whose integrands include the minimum mean square error (MMSE) of the…

Information Theory · Computer Science 2010-04-30 Neri Merhav

In Sequential Massive Random Access (SMRA), a set of correlated sources is jointly encoded and stored on a server, and clients want to access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server…

Information Theory · Computer Science 2018-01-18 Elsa Dupraz , Thomas Maugey , Aline Roumy , Michel Kieffer

We present a grid-free fluid solver featuring a novel Gaussian representation. Drawing inspiration from the expressive capabilities of 3D Gaussian Splatting in multi-view image reconstruction, we model the continuous flow velocity as a…

Graphics · Computer Science 2025-07-10 Jingrui Xing , Bin Wang , Mengyu Chu , Baoquan Chen

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 the problem of reconstructing a sequence of multidimensional real vectors where some of the data are missing. This problem contains regression and mapping inversion as particular cases where the pattern of missing data is…

Machine Learning · Computer Science 2011-09-16 Miguel Á. Carreira-Perpiñán

New bounds on the rate distortion function of certain non-Gaussian sources, with a proportional-weighted mean-square error (MSE) distortion measure, are given. The growth, g, of the rate distortion function, as a result of changing from a…

Information Theory · Computer Science 2007-07-13 Jacob Binia

The rate-distortion function (RDF) has long been an information-theoretic benchmark for data compression. As its natural extension, the indirect rate-distortion function (iRDF) corresponds to the scenario where the encoder can only access…

Information Theory · Computer Science 2025-03-11 Zichao Yu , Qiang Sun , Wenyi Zhang

The random forced Navier-Stokes equation can be obtained as a variational problem of a proper action. By virtue of incompressibility, the integration over transverse components of the fields allows to cast the action in the form of a large…

Fluid Dynamics · Physics 2009-11-10 R. Collina , R. Livi , A. Mazzino

"Generalized Hydrodynamics" (GHD) stands for a model that describes one-dimensional \textit{integrable} systems in quantum physics, such as ultra-cold atoms or spin chains. Mathematically, GHD corresponds to nonlinear equations of kinetic…

Computational Physics · Physics 2023-11-21 Frederik Møller , Nicolas Besse , Igor E. Mazets , Hans-Peter Stimming , Norbert J. Mauser

Sparse representation leads to an efficient way to approximately recover a signal by the linear composition of a few bases from a learnt dictionary, based on which various successful applications have been achieved. However, in the scenario…

Computer Vision and Pattern Recognition · Computer Science 2018-05-04 Xiang Zhang , Jiarui Sun , Siwei Ma , Zhouchen Lin , Jian Zhang , Shiqi Wang , Wen Gao

Recently, a number of authors have proposed decoding schemes for Reed-Solomon (RS) codes based on multiple trials of a simple RS decoding algorithm. In this paper, we present a rate-distortion (R-D) approach to analyze these…

Information Theory · Computer Science 2009-08-21 Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan

The rate-distortion dimension (RDD) of an analog stationary process is studied as a measure of complexity that captures the amount of information contained in the process. It is shown that the RDD of a process, defined as two times the…

Information Theory · Computer Science 2016-11-18 Farideh Ebrahim Rezagah , Shirin Jalali , Elza Erkip , H. Vincent Poor

We study the rate-distortion function (RDF) for the lossy compression of discrete-time (DT) wide-sense almost cyclostationary (WSACS) Gaussian processes with memory, arising from sampling continuous-time (CT) wide-sense cyclostationary…

Information Theory · Computer Science 2025-07-02 Zikun Tan , Ron Dabora , H. Vincent Poor

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

This paper studies the rate-distortion-perception (RDP) tradeoff for a memoryless source model in the asymptotic limit of large block-lengths. The perception measure is based on a divergence between the distributions of the source and…

Information Theory · Computer Science 2025-04-29 Sadaf Salehkalaibar , Jun Chen , Ashish Khisti , Wei Yu

We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similarly to the classical definition of a successively refinable source, we say that a source is strongly successively refinable if…

Information Theory · Computer Science 2016-03-16 Albert No , Amir Ingber , Tsachy Weissman

Super-resolution (SR) is an ill-posed inverse problem which consists in proposing high-resolution images consistent with a given low-resolution one. While most SR algorithms are deterministic, stochastic SR deals with designing a stochastic…

Image and Video Processing · Electrical Eng. & Systems 2023-03-06 Emile Pierret , Bruno Galerne

We propose a Standing Wave Decomposition (SWD) approximation to Gaussian Process regression (GP). GP involves a costly matrix inversion operation, which limits applicability to large data analysis. For an input space that can be…

Machine Learning · Statistics 2018-09-19 Chi-Ken Lu , Scott Cheng-Hsin Yang , Patrick Shafto

This paper provides a framework to analyze stochastic gradient algorithms in a mean squared error (MSE) sense using the asymptotic normality result of the stochastic gradient descent (SGD) iterates. We perform this analysis by taking the…

Machine Learning · Statistics 2019-10-28 Yakup Ceki Papo

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