Transformations in Learned Image Compression from a Modulation Perspective
Youneng Bao, Fangyang Meng, Wen Tan, Chao Li, Yonghong Tian, Yongsheng Liang
TL;DR
This work addresses improving learned image compression by redesigning transformation modules from a modulation perspective. It treats LIC as a communication system, introduces Transform based on Signal Modulation (TSM), and derives nonlinear variants TPM, TFM, and TJM, complemented by a residual block (ResTSM). Empirical results show BD-rate reductions over GDN baselines (e.g., 3.52% on Kodak with a hyperprior/context model) and competitive performance with lower complexity, validating the cross-disciplinary approach. The study demonstrates that communication-theory guidance can yield practical gains in LIC without substantial architectural overhead, enhancing robustness across datasets and backbones.
Abstract
In this paper, a unified transformation method in learned image compression(LIC) is proposed from the perspective of modulation. Firstly, the quantization in LIC is considered as a generalized channel with additive uniform noise. Moreover, the LIC is interpreted as a particular communication system according to the consistency in structures and optimization objectives. Thus, the technology of communication systems can be applied to guide the design of modules in LIC. Furthermore, a unified transform method based on signal modulation (TSM) is defined. In the view of TSM, the existing transformation methods are mathematically reduced to a linear modulation. A series of transformation methods, e.g. TPM and TJM, are obtained by extending to nonlinear modulation. The experimental results on various datasets and backbone architectures verify that the effectiveness and robustness of the proposed method. More importantly, it further confirms the feasibility of guiding LIC design from a communication perspective. For example, when backbone architecture is hyperprior combining context model, our method achieves 3.52$\%$ BD-rate reduction over GDN on Kodak dataset without increasing complexity.
