Pith. sign in

REVIEW 1 cited by

Blurring Fools the Network -- Adversarial Attacks by Feature Peak Suppression and Gaussian Blurring

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.11442 v1 pith:B4MTMC3U submitted 2020-12-21 cs.CV eess.IV

classification cs.CVeess.IV
keywords blurringgaussianadversarialattacksnetworkdatapeakimage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Existing pixel-level adversarial attacks on neural networks may be deficient in real scenarios, since pixel-level changes on the data cannot be fully delivered to the neural network after camera capture and multiple image preprocessing steps. In contrast, in this paper, we argue from another perspective that gaussian blurring, a common technique of image preprocessing, can be aggressive itself in specific occasions, thus exposing the network to real-world adversarial attacks. We first propose an adversarial attack demo named peak suppression (PS) by suppressing the values of peak elements in the features of the data. Based on the blurring spirit of PS, we further apply gaussian blurring to the data, to investigate the potential influence and threats of gaussian blurring to performance of the network. Experiment results show that PS and well-designed gaussian blurring can form adversarial attacks that completely change classification results of a well-trained target network. With the strong physical significance and wide applications of gaussian blurring, the proposed approach will also be capable of conducting real world attacks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Beyond Invisibility: Learning Robust Visible Watermarks for Stronger Copyright Protection

    cs.LG 2025-06 conditional novelty 7.0 of 10

    HARVIM learns watermark placement to maximize reconstruction error under an inpainting-based removal model, showing modest gains over random watermarks.

Pith tools