Search arXivSearch

arXiv · 2604.19515

Constructive Approaches to Perception-Aware Lossy Source Coding: Information-Theoretic Guidelines

Abstract

Perception-aware lossy source coding has attracted significant recent interest. It augments the classical distortion criterion with an explicit perception constraint, thereby enabling more refined control over fidelity and perceptual quality. Despite rapid progress, the diversity of rate-distortion-perception formulations and their underlying assumptions remains poorly understood by many practitioners. In particular, there is often a tendency to rely heavily on the expressive power of deep neural networks and generative models without clear theoretical guidance, using fundamental limits merely as performance benchmarks rather than as sources of design insight. This tutorial paper aims to bridge this gap by surveying information-theoretic principles that can be leveraged to develop constructive approaches to perception-aware lossy source coding. We distill practical guidelines implied by rate-distortion-perception theory and demonstrate how they inform the design of implementable coding schemes. A simple unit-circle example is used as a pedagogical tool to illustrate key ideas, architectural principles, and tradeoffs in an intuitive and unified manner. Both one-shot and asymptotic settings are examined to highlight conceptual similarities and operational differences. We also clarify the role of common randomness and the notion of universal representation, and elucidate the connections between perception-aware and conventional lossy source coding. Overall, this tutorial provides a principled foundation for developing perception-aware compression systems that go beyond black-box model design.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Hussein, Jun Chen, Chao Tian, S. Sandeep Pradhan. 2026-04-21. Constructive Approaches to Perception-Aware Lossy Source Coding: Information-Theoretic Guidelines. https://arxiv.org/abs/2604.19515

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT