arXiv Computer Vision

FLM: Frequency-Aware Language Models for Generative Image Compression

arXiv Computer Vision
Oct 1

Rethinking Generative Image Compression at Extremely Low Bitrates

The paper introduces RAE-CoD, a diffusion-based compression method that operates in a representation autoencoder space to preserve recognizable content even at extremely low bitrates. It addresses the problem of semantic collapse observed in existing codecs when the bitrate approaches zero, showing that reconstruction losses conflict with semantic objectives and that VAE diffusion models lose efficiency in preserving semantics. Experiments on MSCOCO-30K demonstrate that RAE-CoD outperforms competitors, reducing VFM feature MSE and Fréchet Distance ratios by at least 25.7% and 69.1% at 0.001–0.008 bpp while maintaining stable recognizability and quality.

By Tianyu Zhang, Zhaoyang Jia, Houqiang Li, Dong Liu
Hugging Face Trending Papers
Jul 9

LUMI: Tokenizer-Agnostic LLM-Based Lossless Image Compression

Large language model (LLM)-based lossless image compression methods typically represent pixel data through the native text interface of a pretrained model, converting pixel values into token sequences that the LLM processes through its vocabulary head. This design shows that pretrained language models can provide probability estimates for image coding, but it also couples compression to tokenizer behavior, vocabulary-specific numeric tokens, and model-family-specific adaptation.

arXiv Computer Vision
Oct 16

WaveLLM: Wavelet-Domain LLM Entropy Modeling for Lossless Image Compression

WaveLLM introduces a wavelet-domain entropy model that leverages large language models for lossless image compression. By decomposing images into multi-level wavelet subbands, it transforms heterogeneous prediction tasks into structured, statistically homogeneous subproblems, enabling more effective autoregressive probability estimation. Using a dedicated numerical interface and task-adaptive prompting, WaveLLM, built on Llama‑3.2‑3B with LoRA, achieves state‑of‑the‑art bpsp results on Kodak, CLIC.pro, and DIV2K, outperforming both PixelCNN‑based codecs and recent LLM‑based compressors.

By Yue Yu, Bowei Kang, Changsheng Gao, Dong Liu, Xiaoyan Sun
arXiv Computer Vision
Sep 4

Tree-Structured Vector Quantization For Efficient And Progressive Image Compression

Tree-VQ introduces a progressive tree‑structured vector quantization framework for learned image compression, organizing discrete codewords in a hierarchical binary tree where each latent token is represented by a routed root‑to‑leaf path. Every prefix of this path yields a valid quantized representation, enabling coarse reconstructions from shallow nodes and successive refinements from deeper nodes. The method incorporates a prefix‑compatible tree entropy model, rate‑aware refinement scheduling, and hierarchical prefix supervision to achieve efficient, low‑latency compression with superior perceptual quality and fewer parameters compared to existing approaches.

By Xinkun Wang, Tianyi Xu, Qingyu Luo, Mingming Ma, Changzhe Jiao, Fu Li, Yi Niu
Hugging Face Trending Papers
Aug 12

HAMP-LIC: Hessian-Aware Mixed-Precision Post-Training Quantization for Learned Image Compression

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.

arXiv Machine Learning
Aug 11

Statistically-Lossless Quantization of Large Language Models

arXiv:2605. 02404v2 Announce Type: replace Abstract: Model quantization has become essential for efficient large language model deployment, yet existing approaches present clear trade-offs: methods such as GPTQ and AWQ achieve practical compression but are lossy, while lossless techniques preserve fidelity but lack inference acceleration.

By Michael Helcig, Eldar Kurtic, Dan Alistarh