mlsanityData to 14 Oct 2026

Neural Image Compression Using Masked Sparse Visual Representation

arXiv 2309.11661 ↗First posted 20 Sep 2023cs.CV eess.IVcited by 5

Not on the map. Why?

Abstract (arXiv)

We study neural image compression based on the Sparse Visual Representation (SVR), where images are embedded into a discrete latent space spanned by learned visual codebooks. By sharing codebooks with the decoder, the encoder transfers integer codeword indices that are efficient and cross-platform robust, and the decoder retrieves the embedded latent feature using the indices for reconstruction. Previous SVR-based compression lacks effective mechanism for rate-distortion tradeoffs, where one can only pursue either high reconstruction quality or low transmission bitrate. We propose a Masked Adaptive Codebook learning (M-AdaCode) method that applies masks to the latent feature subspace to balance bitrate and reconstruction quality. A set of semantic-class-dependent basis codebooks are learned, which are weighted combined to generate a rich latent feature for high-quality reconstruction. The combining weights are adaptively derived from each input image, providing fidelity information with additional transmission costs. By masking out unimportant weights in the encoder and recovering them in the decoder, we can trade off reconstruction quality for transmission bits, and the masking rate controls the balance between bitrate and distortion. Experiments over the standard JPEG-AI dataset demonstrate the effectiveness of our M-AdaCode approach.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 28 of its 36 references that are in the map. First posted on arXiv 20 Sep 2023.

Builds on

28 of 36 references.

References · 28

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,177
  3. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  4. 2017Neural Discrete Representation Learningcited by 4,712
  5. 2020Taming Transformers for High-Resolution Image Synthesiscited by 3,253
  6. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  7. 2016Perceptual Losses for Real-Time Style Transfer and Super-Resolutioncited by 2,694
  8. 2021SwinIR: Image Restoration Using Swin Transformercited by 1,887
  9. 2018Variational image compression with a scale hyperpriorcited by 935
  10. 2020Learned Image Compression with Discretized Gaussian Mixture Likelihoods and Attention Modulescited by 590
  11. 2017The Perception-Distortion Tradeoffcited by 587
  12. 2021Designing a Practical Degradation Model for Deep Blind Image Super-Resolutioncited by 529
16 more
  1. 2020One-Shot Free-View Neural Talking-Head Synthesis for Video Conferencingcited by 444
  2. 2020High-Fidelity Generative Image Compressioncited by 338
  3. 2022Towards Robust Blind Face Restoration with Codebook Lookup Transformercited by 231
  4. 2022MAGE: MAsked Generative Encoder to Unify Representation Learning and Image Synthesiscited by 227
  5. 2018Generative Adversarial Networks for Extreme Learned Image Compressioncited by 219
  6. 2019Rethinking Lossy Compression: The Rate-Distortion-Perception Tradeoffcited by 211
  7. 2021Checkerboard Context Model for Efficient Learned Image Compressioncited by 202
  8. 2022The Devil Is in the Details: Window-based Attention for Image Compressioncited by 147
  9. 2022Contrastive Masked Autoencoders are Stronger Vision Learnerscited by 133
  10. 2022Entroformer: A Transformer-based Entropy Model for Learned Image Compressioncited by 107
  11. 2022Real-World Blind Super-Resolution via Feature Matching with Implicit High-Resolution Priorscited by 100
  12. 2022RestoreFormer: High-Quality Blind Face Restoration from Undegraded Key-Value Pairscited by 85
  13. 2022VCT: A Video Compression Transformercited by 74
  14. 2022Image Compression with Product Quantized Masked Image Modelingcited by 33
  15. 2023Learning Image-Adaptive Codebooks for Class-Agnostic Image Restorationcited by 14
  16. 2014SIMD Compression and the Intersection of Sorted Integerscited by 1

Built on by

Cited by year

Citing papers per year: 2024: 3; 2025: 2.

5 papers.