arXiv:2610.18125v1 Announce Type: cross Abstract: Training-free diffusion-based compression methods repurpose the generative priors of a diffusion or a flow model to compress data without retraining...
arXiv:2610.27374v1 Announce Type: new Abstract: Neural image codecs face a fundamental trade-off between pixel fidelity and perceptual quality. Distortion-optimized codecs preserve pixel-wise fidelit...
arXiv:2609.39222v1 Announce Type: new Abstract: High-compression tokenizers are essential for scaling latent image generative models. However, aggressive compression creates a fundamental tradeoff be...
arXiv:2609.39451v1 Announce Type: new Abstract: Progressive autoregressive image codecs provide an appealing paradigm for generative compression by quantizing continuous latents into discrete tokens,...
arXiv:2606.21030v2 Announce Type: replace-cross Abstract: Diffusion-based image compression has achieved strong perceptual quality at ultra-low bitrates. However, existing codecs are often tied to sp...
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.
BudgetPix introduces a compute‑adaptive tokenization framework for pixel‑space image diffusion, dynamically allocating computational resources based on visual complexity and spatial layout. It comprises an adaptive encoder using an entropy‑guided quadtree and multi‑scale patch embedder, a scale‑aware decoder, and a flexible training schedule that allows pixel‑space denoisers to operate across variable token counts. The method integrates with existing diffusion architectures, achieving comparable fidelity to larger models while using only a fraction of the compute budget, and demonstrates improved quality‑efficiency tradeoffs in both text‑to‑image and class‑conditional generation.
arXiv:2501.13558v4 Announce Type: replace Abstract: Splat-based radiance fields have rapidly diversified in primitive type, kernel support, and appearance parameterization. This diversity makes compr...
KISS-GS is a modular compression pipeline for 3D Gaussian Splatting (3DGS) scenes that separates compression from training. It first compacts a vanilla 3DGS scene by 15.7× using state‑of‑the‑art pruning, then encodes the result into the SOG‑XT image‑based format, achieving an additional 6.6× reduction. Optional encoding‑aware fine‑tuning can further cut the size by 2.2×, yielding total reductions of 85× to 319× on standard benchmarks while enabling web‑native decoding.
ActDiff-VC is a diffusion-based video compression framework designed for ultra‑low‑bitrate scenarios. It partitions videos into variable‑length segments, transmits keyframes only when necessary, and encodes temporal dynamics with a compact set of tracked point trajectories. Conditioned on these sparse signals, a conditional diffusion decoder reconstructs the remaining frames, achieving significant bitrate reductions and perceptual quality gains compared to strong learned codecs.
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.
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.