Dual-Constrained Diffusion Image Compression for Operational Rate-Distortion-Perception Optimization
- URL: http://arxiv.org/abs/2606.13366v1
- Date: Thu, 11 Jun 2026 13:53:02 GMT
- Title: Dual-Constrained Diffusion Image Compression for Operational Rate-Distortion-Perception Optimization
- Abstract summary: We propose DCIC (Dual-Constrained Diffusion Image Compression), which integrates a learned with a diffusion-based decoder governed by joint distortion and idempotence constraints.<n>At fixed rate, dual attenuation factors $(K_D, K_P)$ jointly navigate the frontier of the distortion-perception plane, enabling continuously adjustable fidelity-realism trade-offs from a single bitstream.
- Score: 12.089576134087594
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The rate-distortion-perception (RDP) trade-off extends classical rate--distortion theory by imposing a distributional constraint on reconstructions, providing a unified framework for neural image compression that jointly governs fidelity and perceptual realism. While prior work achieves near-optimal rate--perception trade-offs, practical frameworks explicitly realizing the full RDP surface remain scarce, primarily due to the difficulty of introducing common randomness at the decoder. We propose DCIC (Dual-Constrained Diffusion Image Compression), which integrates a learned codec with a diffusion-based decoder governed by joint distortion and idempotence constraints. The distortion constraint bounds reconstruction fidelity relative to the base codec output; the idempotence constraint -- requiring that re-encoding the restored image recovers the base codec reconstruction -- serves as a tractable surrogate for the distributional perception requirement. Together, they steer the reverse denoising process via iterative optimization with consistent noise injection, realizing common randomness without additional rate overhead. At fixed rate, dual attenuation factors $(K_D, K_P)$ jointly navigate the Pareto frontier of the distortion-perception plane, enabling continuously adjustable fidelity-realism trade-offs from a single bitstream. DCIC$_{RD}$ ($K_P{=}0$) and DCIC$_{RP}$ ($K_D{=}0$) arise as boundary curves, with DCIC$_{RDP}$ ($K_D = K_P=1$) realizing the optimal interior operating point. Experiments on CelebA-HQ, CLIC2020, and ImageNet-1K across CNN, Transformer, and hybrid architectures confirm that DCIC$_{RDP}$ achieves superior BD-PSNR over all perceptual codecs, while DCIC$_{RP}$ matches dedicated perception-oriented methods in BD-FID, validating the practical value of full RDP surface navigation.
Related papers
- Group-of-Latents: Perceptual Video Compression at Extreme Bitrates via Masked Latent Generative Modeling [49.11379121512358]
We propose a unified generative framework that leverages pre-trained Diffusion Transformer priors to achieve high perceptual quality at extremely lows.<n>Our method achieves state-of-the-art perceptual fidelity with rich spatial details and robust temporal consistency.
arXiv Detail & Related papers (2026-07-21T06:36:32Z) - ZeroGVC: Zero-Shot Generative Video Compression with Autoregressive Diffusion Priors [52.50325804778549]
We propose ZeroGVC, a zero-shot generative video compression framework.<n>ZeroGVC encodes the first frame of each group of pictures (GOP) with an image and represents subsequent P-frames through Codebook-Guided Autoregressive Latent Compression.<n>Experiments on standard video compression benchmarks demonstrate that ZeroGVC achieves superior perceptual reconstruction quality at ultra-lows without any additional training.
arXiv Detail & Related papers (2026-06-21T07:46:14Z) - Exploiting Semantic and Pixel Representations for Ultra-Low Bitrate Image Compression [46.54433210034761]
SPRDiff is a diffusion-based compression method that fully leverages both semantic and pixel representations.<n>We develop a triple-encoder architecture that utilizes high-fidelity features from the pretrained distortion-oriented and semantic-oriented encoders.<n>Experiments on benchmark datasets demonstrate that our method outperforms state-of-the-art approaches in the rate-distortion-perception tradeoff.
arXiv Detail & Related papers (2026-06-01T02:59:31Z) - Joint Degradation-Aware Arbitrary-Scale Super-Resolution for Variable-Rate Extreme Image Compression [28.21479870337623]
ASSR-EIC is a novel image compression framework that supports variable-rate extreme image compression.<n>We exploit the compression- and rescaling-aware diffusion prior to guide the reconstruction, yielding high fidelity and high realism restoration.
arXiv Detail & Related papers (2026-03-18T06:35:53Z) - D-Compress: Detail-Preserving LiDAR Range Image Compression for Real-Time Streaming on Resource-Constrained Robots [2.6111100616898852]
D-Compress is a new detail-preserving and fast range image compression framework for real-time streaming.<n>It outperforms state-of-the-art (SOTA) compression methods in both geometric accuracy and downstream task performance.
arXiv Detail & Related papers (2026-03-14T02:15:25Z) - Training-Free Rate-Distortion-Perception Traversal With Diffusion [44.11458502528137]
We propose a training-free framework that leverages pre-trained diffusion models to traverse the entire surface.<n>Our results establish a practical and theoretically grounded approach to neural-aware compression.
arXiv Detail & Related papers (2026-03-04T12:49:13Z) - Joint Source-Channel-Generation Coding: From Distortion-oriented Reconstruction to Semantic-consistent Generation [58.67925548779465]
We propose Joint Source-Channel-Generation Coding (JSCGC), a novel paradigm that shifts the focus from perceptual reconstruction to probabilistic generation.<n>JSCGC improves substantially semantic quality and semantic fidelity, significantly outperforming conventional distortion-oriented J SCC methods.
arXiv Detail & Related papers (2026-01-19T08:12:47Z) - Universal Representations for Classification-enhanced Lossy Compression [3.3838477077773925]
In lossy compression, the classical tradeoff between compression rate and reconstruction distortion has traditionally been guided algorithm design.<n>More recently, the rate-distortion-classification function was investigated in [19], evaluating compression performance by considering classification accuracy alongside distortion.<n>We explore universal representations, where a single encoder is developed to achieve multiple decoding objectives across various distortion and classification constraints.
arXiv Detail & Related papers (2025-04-12T00:55:56Z) - SING: Semantic Image Communications using Null-Space and INN-Guided Diffusion Models [52.40011613324083]
Joint source-channel coding systems (DeepJSCC) have recently demonstrated remarkable performance in wireless image transmission.<n>Existing methods focus on minimizing distortion between the transmitted image and the reconstructed version at the receiver, often overlooking perceptual quality.<n>We propose SING, a novel framework that formulates the recovery of high-quality images from corrupted reconstructions as an inverse problem.
arXiv Detail & Related papers (2025-03-16T12:32:11Z) - Once-for-All: Controllable Generative Image Compression with Dynamic Granularity Adaptation [52.82508784748278]
This paper proposes a Control Generative Image Compression framework, termed Control-GIC.<n>Control-GIC is capable of fine-grained adaption across a broad spectrum while ensuring high-fidelity and generality compression.<n>Our experiments show that Control-GIC allows highly flexible and controllable adaption where the results demonstrate its superior performance over recent state-of-the-art methods.
arXiv Detail & Related papers (2024-06-02T14:22:09Z) - Communication-Efficient Distributed Learning with Local Immediate Error
Compensation [95.6828475028581]
We propose the Local Immediate Error Compensated SGD (LIEC-SGD) optimization algorithm.
LIEC-SGD is superior to previous works in either the convergence rate or the communication cost.
arXiv Detail & Related papers (2024-02-19T05:59:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.