arXiv Computer Vision
Tree-VQ: Progressive Image Compression from Pretrained Vector Quantizers
Read the original on arXiv Computer Vision →The Flow has not summarised this story yet — read it at arXiv Computer Vision.
Related stories
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.
arXiv Computer Vision
Oct 1
ResARC: Residual-Aware AutoRegressive Coding for Ultra-Low Bitrate Image Compression
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 Computer Vision
3d ago
Efficient Generative Image Compression with Quantized Latents Refinement
arXiv:2610.29691v1 Announce Type: new Abstract: Generative image compression (GIC) delivers strong perceptual quality at low bitrates. However, GIC methods with strong perceptual quality often rely o...
arXiv Computer Vision
6d ago
GoDe: Gaussians on Demand for Backbone-Agnostic Progressive Compression
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...
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.
arXiv AI
Oct 15
H-DDCM: Hadamard Codebooks for Fast Generative Image and Video Compression
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...