|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM355204118 |
| 003 |
DE-627 |
| 005 |
20231226063841.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231226s2023 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2022.3231886
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1183.xml
|
| 035 |
|
|
|a (DE-627)NLM355204118
|
| 035 |
|
|
|a (NLM)37015667
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Wei, Xingxing
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Simultaneously Optimizing Perturbations and Positions for Black-Box Adversarial Patch Attacks
|
| 264 |
|
1 |
|c 2023
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 06.06.2023
|
| 500 |
|
|
|a Date Revised 06.06.2023
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Adversarial patch is an important form of real-world adversarial attack that brings serious risks to the robustness of deep neural networks. Previous methods generate adversarial patches by either optimizing their perturbation values while fixing the pasting position or manipulating the position while fixing the patch's content. This reveals that the positions and perturbations are both important to the adversarial attack. For that, in this article, we propose a novel method to simultaneously optimize the position and perturbation for an adversarial patch, and thus obtain a high attack success rate in the black-box setting. Technically, we regard the patch's position, the pre-designed hyper-parameters to determine the patch's perturbations as the variables, and utilize the reinforcement learning framework to simultaneously solve for the optimal solution based on the rewards obtained from the target model with a small number of queries. Extensive experiments are conducted on the Face Recognition (FR) task, and results on four representative FR models show that our method can significantly improve the attack success rate and query efficiency. Besides, experiments on the commercial FR service and physical environments confirm its practical application value. We also extend our method to the traffic sign recognition task to verify its generalization ability
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Guo, Ying
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Yu, Jie
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Zhang, Bo
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 45(2023), 7 vom: 26. Juli, Seite 9041-9054
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:45
|g year:2023
|g number:7
|g day:26
|g month:07
|g pages:9041-9054
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2022.3231886
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 45
|j 2023
|e 7
|b 26
|c 07
|h 9041-9054
|