English
Related papers

Related papers: Towards Optimality in Transform Coding

200 papers

An effective 'on-the-fly' mechanism for stochastic lossy coding of Markov sources using string matching techniques is proposed in this paper. Earlier work has shown that the rate-distortion bound can be asymptotically achieved by a 'natural…

Information Theory · Computer Science 2023-01-18 Ahmed Elshafiy , Kenneth Rose

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 work, the problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is considered. The intended receiver is assumed to have a certain minimum SNR and the…

Information Theory · Computer Science 2010-08-03 Ghadamali Bagherikaram , Konstantinos N. Plataniotis

We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate…

Quantum Physics · Physics 2009-11-07 Masahito Hayashi , Keiji Matsumoto

The optimal causal coding of a partially observed Markov process is studied, where the cost to be minimized is a bounded, non-negative, additive, measurable single-letter function of the source and the receiver output. A structural result…

Information Theory · Computer Science 2012-08-24 Serdar Yüksel

Conditional Optimal Transport (COT) problem aims to find a transport map between conditional source and target distributions while minimizing the transport cost. Recently, these transport maps have been utilized in conditional generative…

Machine Learning · Computer Science 2026-03-13 Jiwoo Yoon , Kyumin Choi , Jaewoong Choi

In this paper, we obtain necessary optimality conditions for neural network approximation. We consider neural networks in Manhattan ($l_1$ norm) and Chebyshev ($\max$ norm). The optimality conditions are based on neural networks with at…

Optimization and Control · Mathematics 2025-06-24 Vinesha Peiris , Nadezda Sukhorukova , Julien Ugon

In this paper we consider the minimization of a continuous function that is potentially not differentiable or not twice differentiable on the boundary of the feasible region. By exploiting an interior point technique, we present first- and…

Computational Complexity · Computer Science 2017-02-15 Gabriel Haeser , Hongcheng Liu , Yinyu Ye

For the last few decades, the application of signal-adaptive transform coding to video compression has been stymied by the large computational complexity of matrix-based solutions. In this paper, we propose a novel parametric approach to…

Image and Video Processing · Electrical Eng. & Systems 2025-05-29 Amir Said , Xin Zhao , Marta Karczewicz , Hilmi E. Egilmez , Vadim Seregin , Jianle Chen

This is a tutorial and survey paper on Karush-Kuhn-Tucker (KKT) conditions, first-order and second-order numerical optimization, and distributed optimization. After a brief review of history of optimization, we start with some preliminaries…

Optimization and Control · Mathematics 2021-10-06 Benyamin Ghojogh , Ali Ghodsi , Fakhri Karray , Mark Crowley

The classical method to solve a quadratic optimization problem with nonlinear equality constraints is to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using Newton's method. This approach however is usually computationally…

Optimization and Control · Mathematics 2016-03-17 Tuan T. Nguyen , Mircea Lazar , Hans Butler

In this paper, we study systematic Luby Transform (SLT) codes over additive white Gaussian noise (AWGN) channel. We introduce the encoding scheme of SLT codes and give the bipartite graph for iterative belief propagation (BP) decoding…

Information Theory · Computer Science 2015-05-11 Shengkai Xu , Dazhuan Xu , Xiaofei Zhang , Hanqin Shao

We investigate the upper and lower bounds on the quantization distortions for independent and identically distributed sources in the finite block-length regime. Based on the convex optimization framework of the rate-distortion theory, we…

Information Theory · Computer Science 2013-06-21 Chen Gong , Xiaodong Wang

The distortion-rate function of output-constrained lossy source coding with limited common randomness is analyzed for the special case of squared error distortion measure. An explicit expression is obtained when both source and…

Information Theory · Computer Science 2024-03-25 Li Xie , Liangyan Li , Jun Chen , Zhongshan Zhang

The classical coding theorem in Kolmogorov complexity states that if an $n$-bit string $x$ is sampled with probability $\delta$ by an algorithm with prefix-free domain then K$(x) \leq \log(1/\delta) + O(1)$. In a recent work, Lu and…

Computational Complexity · Computer Science 2022-04-19 Zhenjian Lu , Igor C. Oliveira , Marius Zimand

We introduce a general framework for end-to-end optimization of the rate--distortion performance of nonlinear transform codes assuming scalar quantization. The framework can be used to optimize any differentiable pair of analysis and…

Information Theory · Computer Science 2020-07-28 Johannes Ballé , Valero Laparra , Eero P. Simoncelli

Analog (uncoded) transmission provides a simple and robust scheme for communicating a Gaussian source over a Gaussian channel under the mean squared error (MSE) distortion measure. Unfortunately, its performance is usually inferior to the…

Information Theory · Computer Science 2010-06-03 Yuval Kochman , Ram Zamir

This paper investigates the statistical properties of non-linear transformations (NLT) of random variables, in order to establish useful tools for estimation and information theory. Specifically, the paper focuses on linear regression…

Information Theory · Computer Science 2013-05-13 Paolo Banelli

The rate-distortion curve captures the fundamental tradeoff between compression length and resolution in lossy data compression. However, it conceals the underlying dynamics of optimal source encodings or test channels. We argue that these…

Information Theory · Computer Science 2023-07-03 Shlomi Agmon

Optimal transport has numerous applications, particularly in machine learning tasks involving generative models. In practice, the transportation process often encounters an information bottleneck, typically arising from the conversion of a…

Information Theory · Computer Science 2024-12-30 Xiqiang Qu , Ruibin Li , Jun Chen , Lei Yu , Xinbing Wang
‹ Prev 1 3 4 5 6 7 10 Next ›