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:2609.03641v2 Announce Type: replace Abstract: Progressive image compression requires a single embedded representation whose received prefixes can be decoded without re-encoding the source. Mode...
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: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: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:2608.28687v1 Announce Type: new Abstract: Generative models have significantly improved the performance ceiling of image lossy compression at low bitrates by exploiting learned priors. However,...
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.
The paper introduces D-Quant, a KV cache quantization framework that addresses the memory bottleneck of large language models by using a drift mechanism to convert entropy-coded representations into fixed-size bitstreams. This approach leverages the non-uniform distribution of KV cache values—after rotation and normalization, they approximate a normal distribution—allowing entropy coding to assign shorter codewords to frequent symbols while maintaining regular memory layouts suitable for parallel attention kernels. D-Quant thus aims to reduce memory footprint and bandwidth usage without sacrificing performance.
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.
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: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...
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:2610.15092v1 Announce Type: cross Abstract: Quantization plays a crucial role in efficiently deploying deep learning models on resource-constrained devices. Post-training quantization does not...