Checkerboard Context Model for Efficient Learned Image Compression

By Dailan He, Yaoyan Zheng, Baochen Sun, Yan Wang, Hongwei Qin. Computer Vision and Pattern Recognition, 2021

412 citations recorded by the source corpus.

For learned image compression, the autoregressive context model is proved effective in improving the rate-distortion (RD) performance. Because it helps remove spatial redundancies among latent representations. However, the decoding process must be done in a strict scan order, which breaks the parallelization. We propose a parallelizable checkerboard context model (CCM) to solve the problem. Our two-pass checkerboard context calculation eliminates such limitations on spatial locations by re-organizing the decoding order. Speeding up the decoding process more than 40 times in our experiments, it achieves significantly improved computational efficiency with almost the same rate-distortion performance. To the best of our knowledge, this is the first exploration on parallelization-friendly spatial context model for learned image compression.

Subfields: Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/d64945650501eaccd842ed5f93fe0e8932cac50c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Lianli Gao
  2. Jiangpeng He
  3. Jingkuan Song
  4. Feng Zhu
  5. Zhihao Duan
  6. Justin Yang
  7. Zi Yang
  8. Jackie Ma

Citations in the corpus