Fast Test-Time Refinement for Robust Learned Image Compression
Not on the map. Why?
Abstract (arXiv)
Learned image compression (LIC) has demonstrated remarkable rate-distortion (RD) performance in benign settings. However, the high representational capacity endowed by deep neural networks (DNNs) comes at the expense of increased adversarial vulnerability. This hinders their adoption as trusted standardized codecs. Recent work has sketched test-time refinement (TTR) as a defense in gray-box scenarios, despite its original purpose of improving benign RD performance. Unfortunately, extensive iterations of TTR incur prohibitive overhead, while the robustness mechanism lacks theoretical understanding. Moreover, TTR has not been evaluated in white-box settings or against attacks beyond ℓ2-bounded rate and untargeted distortion objectives. To bridge these gaps, we present a systematic study. Our study reveals an Asymmetric Adversarial Trajectory (AAT) property in LIC systems: transitioning from adversarial to benign regions is significantly easier than the reverse process, where adversarial examples can often be roughly recovered within only 1-2 steps. We provide a two-dimensional Tube Model to explain this phenomenon. Based on AAT, we propose a Fast Test-Time Refinement (FTTR) framework for practical and robust LIC systems. We establish that the robustness arises from the contraction of adversarial regions induced by the Input-as-Label property of LIC systems, rather than from obfuscated gradients. Extensive evaluations with diverse strong adaptive attacks across multiple LIC systems demonstrate the promise of the proposed FTTR framework. The code is available at https://github.com/chinaliangjiaming/FTTR.git.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 32 of its 48 references that are in the map. First posted on arXiv 15 Aug 2026.
Builds on
32 of 48 references.
References · 32
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
- 2016End-to-end Optimized Image Compressioncited by 673
- 2018Joint Autoregressive and Hierarchical Priors for Learned Image Compressioncited by 642
- 2016Learning to learn by gradient descent by gradient descentcited by 616
- 2020Learned Image Compression with Discretized Gaussian Mixture Likelihoods and Attention Modulescited by 570
- 2020On Adaptive Attacks to Adversarial Example Defensescited by 547
- 2022ELIC: Efficient Learned Image Compression with Unevenly Grouped Space-Channel Contextual Adaptive Codingcited by 296
20 more
- 2020Channel-wise Autoregressive Entropy Models for Learned Image Compressioncited by 255
- 2023Learned Image Compression with Mixed Transformer-CNN Architecturescited by 205
- 2021Checkerboard Context Model for Efficient Learned Image Compressioncited by 193
- 2022The Devil Is in the Details: Window-based Attention for Image Compressioncited by 141
- 2020Improving Inference for Neural Image Compressioncited by 81
- 2020Universally Quantized Neural Compressioncited by 60
- 2021Soft then Hard: Rethinking the Quantization in Neural Image Compressioncited by 50
- 2019Content Adaptive Optimization for Neural Image Compressioncited by 40
- 2023Backdoor Attacks Against Deep Image Compression via Adaptive Frequency Triggercited by 40
- 2025Learned Image Compression with Dictionary-based Entropy Modelcited by 29
- 2021Towards Robust Neural Image Compression: Adversarial Attack and Model Finetuningcited by 24
- 2025Learned Image Compression with Hierarchical Progressive Context Modelingcited by 20
- 2024Causal Context Adjustment Loss for Learned Image Compressioncited by 19
- 2023Dynamic Low-Rank Instance Adaptation for Universal Neural Image Compressioncited by 10
- 2022High-Fidelity Variable-Rate Image Compression via Invertible Activation Transformationcited by 8
- 2024Attack and Defense Analysis of Learned Image Compressioncited by 3
- 2024Test-time adaptation for image compression with distribution regularizationcited by 3
- 2024Diversify, Contextualize, and Adapt: Efficient Entropy Modeling for Neural Image Codeccited by 3
- 2024Transferable Learned Image Compression-Resistant Adversarial Perturbationscited by 2
- 2024Enhancing Adversarial Training with Prior Knowledge Distillation for Robust Image Compressioncited by 1
Built on by
Not cited yet.