Adversarial Attacks on Scene Graph Generation

被引:1
|
作者
Zhao, Mengnan [1 ]
Zhang, Lihe [2 ]
Wang, Wei [3 ]
Kong, Yuqiu [1 ]
Yin, Baocai [1 ]
机构
[1] Dalian Univ Technol, Sch Comp Sci & Technol, Dalian 116000, Peoples R China
[2] Dalian Univ Technol, Sch Informat & Commun Engn, Dalian 116024, Peoples R China
[3] Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing 100080, Peoples R China
关键词
Task analysis; Object detection; Windows; Visualization; Mirrors; Predictive models; Perturbation methods; Scene graph generation; adversarial attack; bounding box relabeling; two-step weighted attack; NETWORK;
D O I
10.1109/TIFS.2024.3360880
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Scene graph generation (SGG) effectively improves semantic understanding of the visual world. However, the recent interest of researchers focuses on enhancing SGG in non-adversarial settings, which raises our curiosity about the adversarial robustness of SGG models. To bridge this gap, we perform adversarial attacks on two typical SGG tasks, Scene Graph Detection (SGDet) and Scene Graph Classification (SGCls). Specifically, we initially propose a bounding box relabeling method to reconstruct reasonable attack targets for SGCls. It solves the inconsistency between the specified bounding boxes and the scene graphs selected as attack targets. Subsequently, we introduce a two-step weighted attack by removing the predicted objects and relational triples that affect attack performance, which significantly increases the success rate of adversarial attacks on two SGG tasks. Extensive experiments demonstrate the effectiveness of our methods on five popular SGG models and four adversarial attacks.
引用
收藏
页码:3210 / 3225
页数:16
相关论文
共 50 条
  • [31] Review on scene graph generation methods
    Monesh, S.
    Senthilkumar, N. C.
    MULTIAGENT AND GRID SYSTEMS, 2024, 20 (02) : 129 - 160
  • [32] Panoptic Video Scene Graph Generation
    Yang, Jingkang
    Peng, Wenxuan
    Li, Xiangtai
    Guo, Zujin
    Chen, Liangyu
    Li, Bo
    Ma, Zheng
    Zhou, Kaiyang
    Zhang, Wayne
    Loy, Chen Change
    Liu, Ziwei
    2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2023, : 18675 - 18685
  • [33] Scene Graph Generation With Hierarchical Context
    Ren, Guanghui
    Ren, Lejian
    Liao, Yue
    Liu, Si
    Li, Bo
    Han, Jizhong
    Yan, Shuicheng
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2021, 32 (02) : 909 - 915
  • [34] Heterogeneous Learning for Scene Graph Generation
    He, Yunqing
    Ren, Tongwei
    Tang, Jinhui
    Wu, Gangshan
    PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, MM 2022, 2022, : 4704 - 4713
  • [35] Adversarial Adaptation of Scene Graph Models for Understanding Civic Issues
    Kumar, Shanu
    Atreja, Shubham
    Singh, Anjali
    Jain, Mohit
    WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 2943 - 2949
  • [36] Exploring and Exploiting the Hierarchical Structure of a Scene for Scene Graph Generation
    Kurosawa, Ikuto
    Kobayashi, Tetsunori
    Hayashi, Yoshihiko
    2020 25TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2021, : 1422 - 1429
  • [37] Cost-Effective Adversarial Attacks against Scene Text Recognition
    Yang, Mingkun
    Zheng, Haitian
    Bai, Xiang
    Luo, Jiebo
    2020 25TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2021, : 2368 - 2374
  • [38] Robust Graph Neural Networks Against Adversarial Attacks via Jointly Adversarial Training
    Tian, Hu
    Ye, Bowei
    Zheng, Xiaolong
    Wu, Desheng Dash
    IFAC PAPERSONLINE, 2020, 53 (05): : 420 - 425
  • [39] Retraction Note: Imperceptible adversarial attacks against traffic scene recognition
    Yinghui Zhu
    Yuzhen Jiang
    Soft Computing, 2024, 28 (Suppl 2) : 969 - 969
  • [40] Detecting Targets of Graph Adversarial Attacks With Edge and Feature Perturbations
    Lee, Boyi
    Jhang, Jhao-Yin
    Yeh, Lo-Yao
    Chang, Ming-Yi
    Chen, Chia-Mei
    Shen, Chih-Ya
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2024, 11 (03) : 3218 - 3231