DLF: Extreme Image Compression with Dual-generative Latent Fusion

Naifu Xue, Zhaoyang Jia, Jiahao Li, Bin Li, Yuan Zhang +1 more
3/3/2025
cs.CVeess.IV

No official code found. Best implementation: dlfcodec/Dual-generative-Latent-Fusion (51 stars, Apache-2.0, last commit 2025-12-24).

Abstract

Recent studies in extreme image compression have achieved remarkable performance by compressing the tokens from generative tokenizers. However, these methods often prioritize clustering common semantics within the dataset, while overlooking the diverse details of individual objects. Consequently, this results in suboptimal reconstruction fidelity, especially at low bitrates. To address this issue, we introduce a Dual-generative Latent Fusion (DLF) paradigm. DLF decomposes the latent into semantic and detail elements, compressing them through two distinct branches. The semantic branch clusters high-level information into compact tokens, while the detail branch encodes perceptually critical details to enhance the overall fidelity. Additionally, we propose a cross-branch interactive design to reduce redundancy between the two branches, thereby minimizing the overall bit cost. Experimental results demonstrate the impressive reconstruction quality of DLF even below 0.01 bits per pixel (bpp). On the CLIC2020 test set, our method achieves bitrate savings of up to 27.93% on LPIPS and 53.55% on DISTS compared to MS-ILLM. Furthermore, DLF surpasses recent diffusion-based codecs in visual fidelity while maintaining a comparable level of generative realism. Project: https://dlfcodec.github.io/

View on arXivView PDF

Code Implementations(1)

Apache-2.0

[ICCV 2025 Highlight] official code of paper "DLF: Extreme Image Compression with Dual-generative Latent Fusion"

511C, C++Sep 15, 202510 months agoApache-2.0

Similar Papers

Cite this paper

@article{xue2025dlf,
  title  = {DLF: Extreme Image Compression with Dual-generative Latent Fusion},
  author = {Naifu Xue and Zhaoyang Jia and Jiahao Li and Bin Li and Yuan Zhang and Yan Lu},
  year   = {2025},
  eprint = {2503.01428},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.01428v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.01428.svg)](https://codeofpaper.com/paper/2503.01428)

Discussion