arXiv Computer Vision

PULSE: Unlocking Practical Image Compression on Single-Thread CPU

arXiv Computer Vision
Sep 7

Multi-scale Image Representation Compression

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
Hugging Face Trending Papers
Sep 2

Multi-scale Image Representation Compression

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.

arXiv Machine Learning
Oct 12

APEX: Asynchronous Prefix Denoising for Extreme Compression

APEX (Asynchronous Prefix denoising for EXtreme compression) introduces a hierarchical latent space paired with asynchronous denoising over channel groups, enabling efficient extreme compression of images. The method orders channel prefixes from structure to detail, allowing a shared denoiser to generate them at staggered local times without adding tokens. On ImageNet-512, APEX outperforms existing methods at every evaluated channel count under 64x and 128x compression, and surpasses a 256-token model across all budgets when matched for training and guided sampling compute, especially at lower compute levels.

By David Dinkevich, Nisan Chiprut, Yoav HaCohen, Dani Lischinski