mlsanityData to 7 Oct 2026

Learning Scalable ℓ_∞-constrained Near-lossless Image Compression via Joint Lossy Image and Residual Compression

arXiv 2103.17015 ↗First posted 31 Mar 2021eess.IV cs.CVcited by 16

Not on the map. Why?

Abstract (arXiv)

We propose a novel joint lossy image and residual compression framework for learning ℓ_∞-constrained near-lossless image compression. Specifically, we obtain a lossy reconstruction of the raw image through lossy image compression and uniformly quantize the corresponding residual to satisfy a given tight ℓ_∞ error bound. Suppose that the error bound is zero, i.e., lossless image compression, we formulate the joint optimization problem of compressing both the lossy image and the original residual in terms of variational auto-encoders and solve it with end-to-end training. To achieve scalable compression with the error bound larger than zero, we derive the probability model of the quantized residual by quantizing the learned probability model of the original residual, instead of training multiple networks. We further correct the bias of the derived probability model caused by the context mismatch between training and inference. Finally, the quantized residual is encoded according to the bias-corrected probability model and is concatenated with the bitstream of the compressed lossy image. Experimental results demonstrate that our near-lossless codec achieves the state-of-the-art performance for lossless and near-lossless image compression, and achieves competitive PSNR while much smaller ℓ_∞ error compared with lossy image codecs at high bit rates.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 26 of its 53 references that are in the map. First posted on arXiv 31 Mar 2021.

Builds on

26 of 53 references.

References · 26

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019An Introduction to Variational Autoencoderscited by 997
  3. 2018Variational image compression with a scale hyperpriorcited by 910
  4. 2016Conditional Image Generation with PixelCNN Decoderscited by 859
  5. 2016Pixel Recurrent Neural Networkscited by 814
  6. 2016End-to-end Optimized Image Compressioncited by 673
  7. 2018Joint Autoregressive and Hierarchical Priors for Learned Image Compressioncited by 642
  8. 2020Learned Image Compression with Discretized Gaussian Mixture Likelihoods and Attention Modulescited by 570
  9. 2017PixelCNN++: Improving the PixelCNN with Discretized Logistic Mixture Likelihood and Other Modificationscited by 415
  10. 2020High-Fidelity Generative Image Compressioncited by 331
  11. 2017Lossy Image Compression with Compressive Autoencoderscited by 289
  12. 2016Full Resolution Image Compression with Recurrent Neural Networkscited by 170
14 more
  1. 2015Variable Rate Image Compression with Recurrent Neural Networkscited by 168
  2. 2018Context-adaptive Entropy Model for End-to-end Optimized Image Compressioncited by 138
  3. 2018Conditional Probability Models for Deep Image Compressioncited by 128
  4. 2017Real-Time Adaptive Image Compressioncited by 127
  5. 2019Variable Rate Deep Image Compression With a Conditional Autoencodercited by 109
  6. 2018Practical Full Resolution Learned Lossless Image Compressioncited by 93
  7. 2019Practical Lossless Compression with Latent Variables using Bits Back Codingcited by 85
  8. 2019Integer Discrete Flows and Lossless Compressioncited by 82
  9. 2017Learning Convolutional Networks for Content-weighted Image Compressioncited by 73
  10. 2019Bit-Swap: Recursive Bits-Back Coding for Lossless Compression with Hierarchical Latent Variablescited by 51
  11. 2020Learning Better Lossless Compression Using Lossy Compressioncited by 33
  12. 2019Learning Content-Weighted Deep Image Compressioncited by 28
  13. 20203-D Context Entropy Model for Improved Practical Image Compressioncited by 10
  14. 2018Near-lossless ℓ_∞-constrained Image Decompression via Deep Neural Networkcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 3; 2023: 1; 2024: 6; 2025: 2; 2026: 2.

16 papers.

Sort: