JMA: a General Algorithm to Craft Nearly Optimal Targeted Adversarial Examples

IF 8 1区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

IEEE Transactions on Information Forensics and Security Pub Date : 2025-09-19 DOI:10.1109/tifs.2025.3611121

Benedetta Tondi, Wei Guo, Niccolò Pancino, Mauro Barni

引用次数: 0

查看原文本刊更多论文

JMA：一种通用算法来制作接近最优的目标对抗示例

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Information Forensics and Security 工程技术-工程：电子与电气

CiteScore

14.40

自引率

7.40%

发文量

234

审稿时长

6.5 months

期刊介绍： The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features