Pith

open record

sign in
Browse

arxiv: 2204.11448 · v2 · pith:O2BC37LJ · submitted 2022-04-25 · eess.IV · cs.CV

High-Efficiency Lossy Image Coding Through Adaptive Neighborhood Information Aggregation

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:O2BC37LJrecord.jsonopen to challenge →

classification eess.IV cs.CV
keywords codingimageinformationmethodneighborhoodadaptiveaggregationcompression
0
0 comments X
read the original abstract

Questing for learned lossy image coding (LIC) with superior compression performance and computation throughput is challenging. The vital factor behind it is how to intelligently explore Adaptive Neighborhood Information Aggregation (ANIA) in transform and entropy coding modules. To this end, Integrated Convolution and Self-Attention (ICSA) unit is first proposed to form a content-adaptive transform to characterize and embed neighborhood information dynamically of any input. Then a Multistage Context Model (MCM) is devised to progressively use available neighbors following a pre-arranged spatial-channel order for accurate probability estimation in parallel. ICSA and MCM are stacked under a Variational AutoEncoder (VAE) architecture to derive rate-distortion optimized compact representation of input image via end-to-end learning. Our method reports state-of-the-art compression performance surpassing the VVC Intra and other prevalent LIC approaches across Kodak, CLIC, and Tecnick datasets; More importantly, our method offers $>$60$\times$ decoding speedup using a comparable-size model when compared with the most popular LIC method. All materials are made publicly accessible at https://njuvision.github.io/TinyLIC for reproducible research.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.