Hugging Face Trending Papers

Every Packet Counts: Dispersing Information for Loss-Resilient Learned Image Compression

Learned image compression (LIC) has achieved impressive rate-distortion performance. However, existing methods remain highly vulnerable to packet loss, a common challenge in satellite and emergency communications.

arXiv Machine Learning
Aug 18

In-Context Source and Channel Coding

arXiv:2601. 10267v2 Announce Type: replace Abstract: Separate Source-Channel Coding (SSCC) remains attractive for text transmission due to its modularity and compatibility with mature entropy coders and powerful channel codes.

By Ziqiong Wang, Tianqi Ren, Rongpeng Li, Zhifeng Zhao, Honggang Zhang
arXiv Machine Learning
Sep 16

Semantic-Aware Neural Video Codec for Error-Resilient Low-Latency Transmission

The paper introduces a semantic‑aware multi‑level neural video codec designed for low‑latency, task‑oriented video transmission over unreliable channels. It builds on the real‑time DCVC‑RT codec by partitioning encoded representations into packets of varying semantic and feature importance, assigning them to priority streams, and employing an error‑resilient entropy model that removes inter‑packet dependencies. Experiments demonstrate that this framework improves robustness against packet erasures, achieving graceful degradation in less important regions while preserving task‑relevant visual content.

By Matin Mortaheb, Homa Esfahanizadeh, Jinfeng Du, Harish Viswanathan
arXiv Machine Learning
Sep 24

Advances in Diffusion-Based Generative Compression

This article reviews recent diffusion‑based methods for generative lossy image compression, highlighting how these techniques encode a source into an embedding and use a diffusion model to iteratively refine the reconstruction during decoding. It discusses the role of auxiliary entropy models for transmitting the embedding, explores the use of diffusion models for information transmission via channel simulation, and frames the discussion within rate‑distortion‑perception theory, common randomness, and inverse‑problem connections. The review also identifies open challenges in the field.

By Yibo Yang, Stephan Mandt
arXiv AI
Jul 8

Contrastive Predictive Coding with Compression for Enhanced Channel State Feedback in Wireless Networks

arXiv:2607. 05419v1 Announce Type: cross Abstract: Accurate and timely channel state information (CSI) is essential for next-generation wireless systems, yet existing works treat CSI compression and CSI prediction as separate problems, both in academia and in current 3GPP studies.

By Ahmed Y. Radwan, Hina Tabassum, Fahad Syed Muhammad, Matthew Baker
arXiv AI
Sep 18

Perceptual Refinement of an End-to-End Video Streaming Pipeline via Generative AI Layers

The paper introduces PRESLEY, an end‑to‑end video streaming pipeline that uses generative AI layers to selectively degrade and restore less important regions of a frame. By replacing destructive block removal with adaptive in‑place degradation and signaling block strength via a side channel, PRESLEY achieves significant bitrate savings and improved background quality compared to its predecessor and pristine baselines. The authors also analyze the theoretical headroom of this architecture, quantifying remaining cost‑axis headroom and modeling post‑restoration damage to guide future rate‑distortion‑restoration selection.

By Emanuele Artioli, Farzad Tashtarian, Christian Timmerer
arXiv Computer Vision
Sep 24

Information Capacity of Generative Video Compression: Quantifying the Rate-Compute Exchange at Identical Quality

The paper introduces the concept of Information Capacity (IC) to quantify how much bandwidth savings a unit of decoder compute can achieve in generative video compression (GVC). By modeling reconstruction quality as a two‑factor power law in data rate and compute, the authors fit measured DISTS of two GVC decoders with high accuracy and define IC as the negative logarithmic slope along an iso‑quality contour. IC is dimensionless, enabling architecture‑agnostic comparisons and revealing that a 14B decoder trades compute for rate far more efficiently than a 1.3B decoder, with significant variation across datasets.

By Cheng Yuan, Jiawei Shao, Xuelong Li