mlsanityData to 14 Oct 2026

Conditional Latent Coding with Learnable Synthesized Reference for Deep Image Compression

arXiv 2502.09971 ↗First posted 14 Feb 2025cs.CV cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

In this paper, we study how to synthesize a dynamic reference from an external dictionary to perform conditional coding of the input image in the latent domain and how to learn the conditional latent synthesis and coding modules in an end-to-end manner. Our approach begins by constructing a universal image feature dictionary using a multi-stage approach involving modified spatial pyramid pooling, dimension reduction, and multi-scale feature clustering. For each input image, we learn to synthesize a conditioning latent by selecting and synthesizing relevant features from the dictionary, which significantly enhances the model's capability in capturing and exploring image source correlation. This conditional latent synthesis involves a correlation-based feature matching and alignment strategy, comprising a Conditional Latent Matching (CLM) module and a Conditional Latent Synthesis (CLS) module. The synthesized latent is then used to guide the encoding process, allowing for more efficient compression by exploiting the correlation between the input image and the reference dictionary. According to our theoretical analysis, the proposed conditional latent coding (CLC) method is robust to perturbations in the external dictionary samples and the selected conditioning latent, with an error bound that scales logarithmically with the dictionary size, ensuring stability even with large and diverse dictionaries. Experimental results on benchmark datasets show that our new method improves the coding performance by a large margin (up to 1.2 dB) with a very small overhead of approximately 0.5% bits per pixel. Our code is publicly available at https://github.com/ydchen0806/CLC.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 20 of its 49 references that are in the map. First posted on arXiv 14 Feb 2025.

Builds on

20 of 49 references.

References · 20

  1. 2018Variational image compression with a scale hyperpriorcited by 935
  2. 2018Joint Autoregressive and Hierarchical Priors for Learned Image Compressioncited by 664
  3. 2020Learned Image Compression with Discretized Gaussian Mixture Likelihoods and Attention Modulescited by 590
  4. 2021Deep Contextual Video Compressioncited by 221
  5. 2023Learned Image Compression with Mixed Transformer-CNN Architecturescited by 211
  6. 2016Full Resolution Image Compression with Recurrent Neural Networkscited by 175
  7. 2023Neural Video Compression with Diverse Contextscited by 165
  8. 2018Context-adaptive Entropy Model for End-to-end Optimized Image Compressioncited by 143
  9. 2018Conditional Probability Models for Deep Image Compressioncited by 133
  10. 2021Temporal Context Mining for Learned Video Compressioncited by 117
  11. 2023Advancing Pose-Guided Image Synthesis with Progressive Conditional Diffusion Modelscited by 104
  12. 2020A Unified End-to-End Framework for Efficient Deep Image Compressioncited by 58
8 more
  1. 2024SD-MVS: Segmentation-Driven Deformation Multi-View Stereo with Spherical Refinement and EM optimizationcited by 19
  2. 2024MapExpert: Online HD Map Construction with Simple and Efficient Sparse Map Element Expertcited by 17
  3. 2023Learning Multiscale Consistency for Self-supervised Electron Microscopy Instance Segmentationcited by 16
  4. 2024Mask Factory: Towards High-quality Synthetic Data Generation for Dichotomous Image Segmentationcited by 15
  5. 2022TINC: Tree-structured Implicit Neural Compressioncited by 14
  6. 2023T3D: Advancing 3D Medical Vision-Language Pre-training by Learning Multi-View Visual Consistencycited by 14
  7. 2024Ultra-High Resolution Segmentation via Boundary-Enhanced Patch-Merging Transformercited by 10
  8. 2023RFD-ECNet: Extreme Underwater Image Compression with Reference to Feature Dictionarcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 5.

11 papers.