Source-linked AI summary
StableCodec: Taming One-Step Diffusion for Extreme Image Compression
Tianyu Zhang, Xin Luo, Li Li, Dong Liu
TL;DR
Existing diffusion codecs can require many decoder denoising steps and may not preserve pixel-level fidelity, limiting their fit for real-time, extreme-rate compression. StableCodec compresses noisy latents for one-step denoising and adds auxiliary coding branches; it reports strong perceptual metrics at 0.005 bpp with speeds comparable to mainstream transform coding.
Problem
Diffusion-based image compression faces decoder costs from many denoising steps and reconstruction-fidelity limits, despite its potential for realistic results at ultra-low bitrates.
Source: §1 · p. 2Method
StableCodec compresses a noisy latent for one-step SD-Turbo denoising and uses auxiliary encoder and decoder branches to support fidelity.
Source: §1 · p. 2Results
StableCodec reports state-of-the-art FID, KID, and DISTS on CLIC 2020 and DIV2K, with high-fidelity, high-realism reconstructions down to 0.005 bpp and inference speeds comparable to mainstream transform coding.
Source: §1 · p. 3Takeaways & Limitations
The reported results indicate the potential of diffusion models for practical image compression in real-time scenarios with severely constrained bitrates.
Source: §6 · p. 8The pre-trained SD-Turbo VAE is not optimized for pixel-level fidelity or practical entropy coding because its compressed representation remains floating-point.
Source: §3.3.1 · p. 4
Abstract
from arXiv · showhide
Diffusion-based image compression has shown remarkable potential for achieving ultra-low bitrate coding (less than 0.05 bits per pixel) with high realism, by leveraging the generative priors of large pre-trained text-to-image diffusion models. However, current approaches require a large number of denoising steps at the decoder to generate realistic results under extreme bitrate constraints, limiting their application in real-time compression scenarios. Additionally, these methods often sacrifice reconstruction fidelity, as diffusion models typically fail to guarantee pixel-level consistency. To address these challenges, we introduce StableCodec, which enables one-step diffusion for high-fidelity and high-realism extreme image compression with improved coding efficiency. To achieve ultra-low bitrates, we first develop an efficient Deep Compression Latent Codec to transmit a noisy latent representation for a single-step denoising process. We then propose a Dual-Branch Coding Structure, consisting of a pair of auxiliary encoder and decoder, to enhance reconstruction fidelity. Furthermore, we adopt end-to-end optimization with joint bitrate and pixel-level constraints. Extensive experiments on the CLIC 2020, DIV2K, and Kodak dataset demonstrate that StableCodec outperforms existing methods in terms of FID, KID and DISTS by a significant margin, even at bitrates as low as 0.005 bits per pixel, while maintaining strong fidelity. Additionally, StableCodec achieves inference speeds comparable to mainstream transform coding schemes. All source code are available at https://github.com/LuizScarlet/StableCodec.
1. Introduction
At severe bitrates, conventional codecs can produce blurry or unrealistic reconstructions, while diffusion-based approaches face decoding-speed and fidelity challenges. StableCodec combines one-step diffusion with latent and auxiliary coding branches to target realistic, faithful compression at ultra-low bitrates.
- Traditional and learning-based codecs are often optimized for rate-distortion performance and can produce blurry or unrealistic reconstructions under severe bitrate constraints.Generative compression instead emphasizes perceptual quality and the rate-distortion-perception tradeoff [9] [10] [66] [67].Source: §1 · p. 2
- StableCodec combines SD-Turbo one-step denoising with a Deep Compression Latent Codec that transmits noisy latents at ultra-low bitrates.The approach addresses whether such latents can be compressed for effective single-step denoising.Source: §1 · pp. 2–3
- A Dual-Branch Coding Structure adds auxiliary encoder and decoder branches to improve reconstruction fidelity through semantic enhancement and structure apportionment.The auxiliary encoder embeds entropy-aware semantic information for coding decisions, while the decoder supports more consistent details during one-step denoising.Source: §1 · pp. 2–3
- End-to-end training uses a two-stage objective that jointly optimizes bitrate and pixel-level constraints.Source: §1 · p. 3
- StableCodec reports state-of-the-art FID, KID, and DISTS on CLIC 2020 and DIV2K, with high-fidelity, high-realism reconstructions down to 0.005 bpp and decoding speeds comparable to mainstream transform coding.The paper also reports experiments on Kodak and inference at arbitrary resolutions with memory consumption below 9 GB.Source: §1 · p. 3
2. Related Work
Related work spans perceptual transform coding and diffusion-based generative compression, with the latter promising ultra-low-rate results but facing fidelity and inference-efficiency constraints. Few-step diffusion methods seek to reduce denoising cost while retaining generation quality.
2.1. Generative Image Compression
- Learned compression builds on nonlinear transforms and joint rate-distortion optimization, including the end-to-end framework [5], hyperprior [6], and context model [45].Subsequent work [13] [20] [21] [30] [42] [44] [49] addresses rate-distortion performance and practicality.Source: §2.1 · p. 3
- Generative image compression incorporates adversarial training into transform coding to improve perceptual quality, while diffusion-based methods target ultra-low bitrate compression but are constrained by fidelity and multi-step inference.The field evaluates this tradeoff through rate-distortion-perception criteria [9] [10] [66] [67]; GLC [28] applies transform coding in VQ-VAE's generative latent space.Source: §2.1 · p. 3
2.2. Generative Models and Few-Step Diffusions
- Diffusion models learn to reverse a noise perturbation process through a Markovian framework and have become a prominent image-generation approach.DDPM [25], DDIM [56], and LDM [52] are cited as advances that reduced computational complexity and improved image synthesis quality.Source: §2.2 · p. 3
- Few-step diffusion methods approximate the full denoising trajectory in one or a few steps to improve inference efficiency while maintaining generation quality.SD/SDXL-Turbo [54] demonstrates image generation in 1 to 4 steps with near-parity quality compared with multi-step models.Source: §2.2 · p. 3
3. Method
StableCodec combines one-step diffusion with an extreme latent codec and auxiliary coding branches to improve fidelity. Its training jointly constrains bitrate and pixel-level distortion.
3.1. Overview
- StableCodec uses SD-Turbo with a Deep Compression Latent Codec and auxiliary branches, then optimizes bitrate and pixel-level constraints end-to-end.The framework adapts SD-Turbo with LoRA in its VAE encoder and denoising UNet while leaving the VAE decoder unchanged.Source: §3.1 · pp. 3–4, Figure 3 · p. 4
3.2. Deep Compression Latent Codec
- Entropy coding operates on latents at 64× spatial compression and the hyperprior at 256×, then gs restores latents to 8× for denoising and decoding.The codec uses extreme analysis and synthesis transforms and a four-step autoregressive entropy model.Source: §3.2 · p. 4
3.3. Dual-Branch Coding Structure
- The dual-branch structure adds an auxiliary encoder and decoder to improve reconstruction fidelity alongside the latent codec.The encoder supplies semantic information, while the decoder apportions structure during decoding.Source: §3.3 · p. 4, §3.3.1 · pp. 4–5, §3.3.2 · p. 5
3.3.1. Entropy-Aware Semantic Enhancement
- The frozen ELIC analysis transform serves as EAux, adding entropy-aware semantic information that is aligned to 16× resolution and concatenated channel-wise.The SD-Turbo VAE is perceptually oriented and floating-point, limiting pixel-level fidelity and practical entropy coding; Table 1 contrasts its pixel information with ELIC's.Source: §3.3.1 · pp. 4–5, Table 1 · p. 5, Figure 4 · p. 5
3.3.2. Structure Apportionment
- DAux decodes basic structure directly from the bitstream, bypassing the UNet so gs can focus on guidance for realistic details.With DAux, energy in gs latents drops significantly, while more semantically aligned details are reconstructed.Source: §3.3.2 · p. 5, Figure 5 · p. 5
3.4. End-to-End Training Objective
- Training balances bitrate R and pixel-level distortion D with a Lagrange multiplier and uses two-stage implicit bitrate pruning to reach ultra-low target bitrates.The distortion includes MSE, VGG-feature LPIPS, and CLIP-embedding distance; GAN loss is added only in stage two.Source: §3.4 · pp. 5–6
4. Experiments
Experiments assess StableCodec’s rate–distortion–perception performance, qualitative reconstructions, and computational complexity. The reported results show strong perceptual quality at ultra-low bitrates alongside decoding speeds comparable to mainstream transform coding schemes.
4.1. Implementation
- Evaluation covers CLIC 2020 Test, DIV2K Val, and Kodak, emphasizing FID, KID, and DISTS because pixel-level metrics have limitations at ultra-low bitrates.Training uses DF2K and CLIC 2020 Professional; the second stage adds GAN training after a first stage of over 100k iterations.Source: §4.1 · pp. 6–7
4.2.1. Rate-Distortion-Perception Performance
- At bitrates as low as 0.005 bpp, StableCodec outperforms compared methods on FID, KID, and DISTS over CLIC 2020 Test and DIV2K Val.Compared with GLC [28], it shows superior and stable FID and KID performance; TACO [36] has the best LPIPS but high FID, KID, and DISTS scores.Source: §4.2.1 · p. 7
4.2.2. Qualitative Comparisons
- On Kodak, StableCodec produces visually aligned details and realistic textures, while competing methods show blurring, deviations from originals, or artifacts.The examples include teeth and murals; EGIC and TACO show noticeable artifacts in detailed areas.Source: §4.2.2 · pp. 7–8, Figure 7 · p. 7
4.2.3. Computational Complexity
- StableCodec achieves encoding and decoding speeds comparable to representative codecs, with significantly better performance at ultra-low bitrates.The comparison uses a single RTX 3090 GPU; Table 2 reports encoding and decoding seconds averaged on Kodak.Source: Table 2 · p. 7, §4.2.3 · p. 8
5. Ablation Study
Ablations examine the auxiliary coding branch, LoRA ranks, and training strategy, reporting bitrate savings, perceptual and distortion trade-offs, and the role of implicit bitrate pruning.
Auxiliary Encoder and Decoder
- Adding the auxiliary encoder saves more than 20% of bits at the same reconstruction quality, and the auxiliary decoder further improves performance, particularly perceptual quality.The purified gs latent provides better guidance for reconstruction consistency.Source: §5 · p. 8
LoRA Ranks
- Increasing LoRA ranks to 16/32 improves distortion and perception, while larger ranks can degrade performance as pre-trained priors may be corrupted.Adding LoRA to the VAE decoder improves PSNR and MS-SSIM at the cost of LPIPS and DISTS, so the decoder is left unchanged.Source: §5 · p. 8
Training Strategy
- Implicit bitrate pruning improves performance considerably, while GAN training introduces a significant distortion–perception trade-off and the CLIP distance alleviates distortion degradation.The base one-stage objective contains bitrate, MSE, and LPIPS; the ablations progressively add implicit bitrate pruning, adversarial training, and the CLIP distance term.Source: §5 · p. 8, Table 5 · p. 8
6. Conclusion
StableCodec combines one-step diffusion, a Deep Compression Latent Codec, and a Dual-Branch Coding Structure for extreme image compression. The conclusion reports strong FID, KID, and DISTS performance at bitrates as low as 0.005 bpp, with competitive speeds.
6. Conclusion
- StableCodec combines one-step diffusion with a Deep Compression Latent Codec and Dual-Branch Coding Structure to achieve extreme-bitrate compression with realism, fidelity, and coding efficiency.The paper reports FID, KID, and DISTS superiority at bitrates as low as 0.005 bpp, with speeds competitive with mainstream transform coding methods.Source: §6 · p. 8
Supplementary Material
For high-resolution inference, StableCodec processes images in tiles and aggregates overlapping latent patches. A quantized color-correction step addresses observed color shifts with a small bit cost.
A. Inference for Arbitrary Resolution
- Tiled VAE processing and Gaussian-weighted aggregation of overlapping latent patches support arbitrary-resolution inference with memory below 9 GB.The tiles are processed sequentially in the VAE encoder and decoder, and latent patches are processed individually before aggregation.Source: A. Inference for Arbitrary Resolution · p. 12
- Quantized adaptive instance normalization corrects observed high-resolution color shifts by aligning reconstructed-image channel means and variances with the originals.The correction adds 96 bits per image; quantizing the statistics to 16 bits does not significantly affect correction performance.Source: A. Inference for Arbitrary Resolution · p. 12
B. Network Structure
The network structure uses a hyperprior and autoregressive context model to estimate the latent distribution for arithmetic coding. It also includes a color-fix refinement with negligible bitrate increase.
- The entropy model estimates the quantized latent’s distribution for arithmetic coding using a hyperprior module and an autoregressive context model.The hyperprior Φhyper is obtained from y using transforms ha and hs.Source: B. Network Structure · p. 12
- The 16-bit color fix brings clear visual refinement with negligible bitrate increase.Source: Figure 8 · p. 12
- A four-step quadtree-partitioned autoregressive process estimates Gaussian parameters for ˆy using the hyperprior and previously decoded groups.Latent residual prediction is also incorporated to alleviate quantization error.Source: B. Network Structure · p. 12
C. Runtime Analysis
StableCodec’s coding operations are reported as faster than ELIC’s and its decoding speed as comparable to mainstream neural codecs. Its entropy model uses a four-step autoregressive process, while runtime analysis covers specific encoder and decoder modules.
- Runtime analysis measures encoding and decoding modules on a single RTX 3090 GPU, averaged on Kodak images.The measured components include the VAE and auxiliary encoders and decoders, transforms, entropy coding, and one-step denoising.Source: C. Runtime Analysis · pp. 12–13, Table 6 · p. 13
- The entropy model uses a four-step autoregressive process with quadtree partitioning and latent residual prediction.Figure 9 illustrates the entropy model and four-step decoding process.Source: Figure 9 · p. 13
- StableCodec’s transform coding and entropy estimation are reported as much faster than ELIC’s, with coding speed comparable to mainstream neural codecs.The paper attributes the efficiency to transform coding at 16× and entropy estimation at 64×, compared with ELIC’s 16× transform coding and entropy estimation.Source: C. Runtime Analysis · pp. 13–14
D. User Study
In a Kodak user study, StableCodec reconstructions were preferred in over 70% of cases. Additional visual comparisons report stronger semantic consistency and textual realism than competing methods at ultra-low bitrates, while consuming fewer bits.
D. User Study
- The user study compared StableCodec with seven generative codecs on Kodak at similar average bitrates.Each case presented the ground truth and eight reconstructions; participants chose the one most consistent with the ground truth.Source: D. User Study · p. 14
- StableCodec reconstructions were preferred in over 70% of user-study cases, based on 720 evaluations by 30 participants.Participants selected the reconstruction they found most consistent with the ground truth.Source: D. User Study · p. 14
E. Visual Performance
- On DIV2K, CLIC 2020, and USTC-TD images, StableCodec is reported to outperform competing methods in semantic consistency and textual realism while consuming fewer bits.The comparisons cover high-quality images at ultra-low bitrates.Source: E. Visual Performance · p. 14
F. Quantitative Results
The supplied text describes supplemental PSNR and MS-SSIM comparisons while emphasizing FID, KID, and DISTS for assessing severely compressed images; additional visual examples cover DIV2K, CLIC 2020, and USTC-TD.
- The paper describes PSNR and MS-SSIM comparisons on CLIC 2020 and DIV2K as supplemental to its main results.Source: F. Quantitative Results · p. 14
- The paper prioritizes FID, KID, and DISTS because pixel-level metrics are described as less suitable for assessing severely compressed images’ semantic consistency and textual realism.Source: F. Quantitative Results · p. 14
- Additional visual examples compare methods on 2K-resolution images from DIV2K.Source: Figure 12 · p. 15
- Additional visual examples compare methods on 2K-resolution images from CLIC 2020.Source: Figure 13 · p. 16
- Additional visual examples compare methods on 4K-resolution images from USTC-TD.Source: Figure 14 · p. 17, Figure 15 · p. 18
Related papers
Cited by
- H-DDCM: Hadamard Codebooks for Fast Generative Image and Video Compression2026
- VoRTeC: Taming Foundation Flow for One-step Real time Video Compression2026
- FLM: Frequency-Aware Language Models for Generative Image Compression2026
- Mage-Flow: An Efficient Native-Resolution Foundation Model for Image Generation and Editing2026