GABIC: Graph-based Attention Block for Image Compression
Gabriele Spadaro, Alberto Presta, Enzo Tartaglione, Jhony H. Giraldo, Marco Grangetto, Attilio Fiandrotti
TL;DR
The paper addresses redundancy in attention mechanisms used by Learned Image Compression (LIC) and proposes Graph-based Attention Block for Image Compression (GABIC), which constrains attention to a local $k$-NN graph within each window. GABIC updates patch embeddings via a graph convolution with attention coefficients $\alpha_{i,j}$ computed from projected features, reducing redundant feature aggregation; the block is integrated into a hyperprior LIC framework with a channel-wise entropy model. On Kodak and CLIC benchmarks, GABIC achieves BD-Rate gains of about $1.50\%$ and $0.89\%$, respectively, with the strongest improvements at high bitrates and better preservation of high-frequency details; the approach maintains comparable complexity to window-based attention methods. The work demonstrates a promising direction for LIC by fusing graph attention with local window processing and provides code and trained models for reproducibility.
Abstract
While standardized codecs like JPEG and HEVC-intra represent the industry standard in image compression, neural Learned Image Compression (LIC) codecs represent a promising alternative. In detail, integrating attention mechanisms from Vision Transformers into LIC models has shown improved compression efficiency. However, extra efficiency often comes at the cost of aggregating redundant features. This work proposes a Graph-based Attention Block for Image Compression (GABIC), a method to reduce feature redundancy based on a k-Nearest Neighbors enhanced attention mechanism. Our experiments show that GABIC outperforms comparable methods, particularly at high bit rates, enhancing compression performance.
