The paper introduces MIRC, an overfitted image codec that quantizes and entropy‑codes all components—including latents, synthesis network, and entropy models—within a single end‑to‑end rate‑distortion framework inspired by NVRC. It adds a multi‑scale representation with cross‑stage parameter sharing to capture cross‑scale redundancy, yielding a 10.5 % BD‑rate saving over VVC on the CLIC2020 professional set. MIRC offers multiple configurations ranging from 1.2 to 2.9 kMAC per pixel, allowing decoding complexity to be tuned to deployment needs.
By Tianhao Peng, Ho Man Kwan, Fan Zhang, Shan Liu, David Bull
Scalable Neural Video Representation Compression (S-NVRC) introduces a scalable implicit neural representation (INR) video codec that supports fine-grained bitrate and decoding‑complexity scalability from a single embedded bitstream. It uses a coarse‑to‑fine prefix for feature grids and a nested prefix for network layers, enabling a wide range of operating points while maintaining a single encoding. On the UVG dataset, S‑NVRC outperforms SHM 12.4 and multi‑layer VTM‑20.0 by 43.7 % and 5.6 % in BD‑rate, respectively, and offers flexible complexity scalability.
By Tianhao Peng, Ho Man Kwan, Fan Zhang, Shan Liu, David Bull
The paper introduces MIRC, an overfitted image codec that quantizes all components—including latents, synthesis network, and entropy models—within a single rate‑distortion objective, following the neural video representation codec NVRC. It adds a multi‑scale representation with cross‑stage parameter sharing to capture cross‑scale redundancy, achieving a 10.5% BD‑rate saving over VVC on the CLIC2020 professional validation set. MIRC also offers configurable decoding complexity ranging from 1.2 to 2.9 kMAC per pixel, allowing deployment to match specific resource budgets.
LRConv-NeRV introduces low‑rank separable convolutions into the NeRV neural video decoder, replacing selected dense 3x3 layers to reduce computational load and memory usage. By applying low‑rank factorization progressively from the largest to earlier decoder stages, the method offers controllable trade‑offs between reconstruction quality and efficiency. Experiments show that applying LRConv only to the final decoder stage cuts decoder complexity by 68% and model size by 9.3% with negligible quality loss, while INT8 quantization preserves performance close to the dense baseline.
By Tamer Shanableh
arXiv:2608. 12239v1 Announce Type: cross Abstract: Use this plain-text version for the arXiv abstract field: Learned image compression (LIC) models achieve strong rate-distortion performance but are hindered by high computational complexity and encoding-decoding mismatches across heterogeneous hardware platforms.
By Yuefeng Zhang
COVER is a new video watermarking method that targets codec compression as its primary design goal. It embeds the watermark payload in the latent space of a frozen generative video autoencoder and recovers it by re‑encoding the received video into the same latent space. Using a differentiable codec surrogate bank, COVER achieves high bit accuracy across multiple codecs while keeping marked videos visually close to the originals.
By Yuxin Cao, Hao Yang, Ziqi Ding, Jie Hao, Wei Song
arXiv:2606. 03940v1 Announce Type: cross Abstract: In robotics systems, vast amounts of visual data are easily captured at high resolution using low-cost, low-power hardware.
By Dan Jacobellis, Neeraja J. Yadwadkar
arXiv:2606. 02569v1 Announce Type: cross Abstract: Video is temporally redundant: adjacent frames usually share most objects, background, and layout.
By Haowen Hou, Zhen Huang, Zheming Liang, Qingyi Si, Chenglin Li, Shuai Dong, Kele Shao, Ruilin Li, Dianyi Wang, Nan Duan, Jiaqi Wang
arXiv:2609.39296v1 Announce Type: new
Abstract: Video semantic communication has attracted increasing attention as a promising approach to improving video transmission efficiency. However, most exist...
By Xiangben Zhu, Caili Guo, Yang Yang, Chuanhong Liu, Meiyi Zhu
arXiv:2606. 05861v1 Announce Type: cross Abstract: The rapid development of large language models(LLMs) has led to remarkable advances in natural language processing.
By Rui Wang, Yan Zhao, Li Song, Zhengxue Cheng
Use this plain-text version for the arXiv abstract field: Learned image compression (LIC) models achieve strong rate-distortion performance but are hindered by high computational complexity and encoding-decoding mismatches across heterogeneous hardware platforms. Uniform fixed-precision quantization alleviates these issues but suffers severe quality degradation at low bit widths because it ignores differences in the quantization sensitivities of individual layers.
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