TY - JOUR
T1 - ADSAttack
T2 - An Adversarial Attack Algorithm via Searching Adversarial Distribution in Latent Space
AU - Wang, Haobo
AU - Zhu, Chenxi
AU - Cao, Yangjie
AU - Zhuang, Yan
AU - Li, Jie
AU - Chen, Xianfu
N1 - Funding Information:
This research was funded by the National Natural Science Foundation of China under Grant 61972092 and the Collaborative Innovation Major Project of Zhengzhou (20XTZX06013).
Publisher Copyright:
© 2023 by the authors.
PY - 2023/2
Y1 - 2023/2
N2 - Deep neural networks are susceptible to interference from deliberately crafted noise, which can lead to incorrect classification results. Existing approaches make less use of latent space information and conduct pixel-domain modification in the input space instead, which increases the computational cost and decreases the transferability. In this work, we propose an effective adversarial distribution searching-driven attack (ADSAttack) algorithm to generate adversarial examples against deep neural networks. ADSAttack introduces an affiliated network to search for potential distributions in image latent space for synthesizing adversarial examples. ADSAttack uses an edge-detection algorithm to locate low-level feature mapping in input space to sketch the minimum effective disturbed area. Experimental results demonstrate that ADSAttack achieves higher transferability, better imperceptible visualization, and faster generation speed compared to traditional algorithms. To generate 1000 adversarial examples, ADSAttack takes (Formula presented.) and, on average, achieves a success rate of (Formula presented.).
AB - Deep neural networks are susceptible to interference from deliberately crafted noise, which can lead to incorrect classification results. Existing approaches make less use of latent space information and conduct pixel-domain modification in the input space instead, which increases the computational cost and decreases the transferability. In this work, we propose an effective adversarial distribution searching-driven attack (ADSAttack) algorithm to generate adversarial examples against deep neural networks. ADSAttack introduces an affiliated network to search for potential distributions in image latent space for synthesizing adversarial examples. ADSAttack uses an edge-detection algorithm to locate low-level feature mapping in input space to sketch the minimum effective disturbed area. Experimental results demonstrate that ADSAttack achieves higher transferability, better imperceptible visualization, and faster generation speed compared to traditional algorithms. To generate 1000 adversarial examples, ADSAttack takes (Formula presented.) and, on average, achieves a success rate of (Formula presented.).
KW - adversarial attack
KW - adversarial distribution searching
KW - edge-detection algorithm
KW - latent space
UR - http://www.scopus.com/inward/record.url?scp=85148635753&partnerID=8YFLogxK
U2 - 10.3390/electronics12040816
DO - 10.3390/electronics12040816
M3 - Article
AN - SCOPUS:85148635753
SN - 2079-9292
VL - 12
JO - Electronics
JF - Electronics
IS - 4
M1 - 816
ER -