Towards Imperceptible Query-limited Adversarial Attacks with Perceptual Feature Fidelity Loss
Not on the map. Why?
Abstract (arXiv)
Recently, there has been a large amount of work towards fooling deep-learning-based classifiers, particularly for images, via adversarial inputs that are visually similar to the benign examples. However, researchers usually use Lp-norm minimization as a proxy for imperceptibility, which oversimplifies the diversity and richness of real-world images and human visual perception. In this work, we propose a novel perceptual metric utilizing the well-established connection between the low-level image feature fidelity and human visual sensitivity, where we call it Perceptual Feature Fidelity Loss. We show that our metric can robustly reflect and describe the imperceptibility of the generated adversarial images validated in various conditions. Moreover, we demonstrate that this metric is highly flexible, which can be conveniently integrated into different existing optimization frameworks to guide the noise distribution for better imperceptibility. The metric is particularly useful in the challenging black-box attack with limited queries, where the imperceptibility is hard to achieve due to the non-trivial perturbation power.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 56 references that are in the map. First posted on arXiv 31 Jan 2021.
Builds on
26 of 56 references.
References · 26
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2013Intriguing properties of neural networkscited by 5,114
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2018Black-box Adversarial Attacks with Limited Queries and Informationcited by 499
- 2017Decision-Based Adversarial Attacks: Reliable Attacks Against Black-Box Machine Learning Modelscited by 459
- 2019HopSkipJumpAttack: A Query-Efficient Decision-Based Attackcited by 328
- 2017On Detecting Adversarial Perturbationscited by 232
- 2017Generating Natural Adversarial Examplescited by 182
- 2017On the (Statistical) Detection of Adversarial Examplescited by 180
14 more
- 2018Query-Efficient Hard-label Black-box Attack:An Optimization-based Approachcited by 130
- 2019Sign-OPT: A Query-Efficient Hard-label Adversarial Attackcited by 118
- 2019Sparse and Imperceivable Adversarial Attackscited by 95
- 2019SemanticAdv: Generating Adversarial Examples via Attribute-conditional Image Editingcited by 93
- 2019Wasserstein Adversarial Examples via Projected Sinkhorn Iterationscited by 89
- 2018Semantic Adversarial Examplescited by 86
- 2018GenAttack: Practical Black-box Attacks with Gradient-Free Optimizationcited by 82
- 2017Exploring the Landscape of Spatial Robustnesscited by 81
- 2019Towards Large yet Imperceptible Adversarial Image Perturbations with Perceptual Color Distancecited by 72
- 2018On the Suitability of Lp-norms for Creating and Preventing Adversarial Examplescited by 57
- 2018Towards Imperceptible and Robust Adversarial Example Attacks against Neural Networkscited by 38
- 2019SROBB: Targeted Perceptual Loss for Single Image Super-Resolutioncited by 31
- 2019CFSNet: Toward a Controllable Feature Space for Image Restorationcited by 25
- 2019Should Adversarial Attacks Use Pixel p-Norm?cited by 10
Built on by
Not cited yet.