Robust semantic segmentation is crucial for safe autonomous driving, yet deployed models remain vulnerable to black-box adversarial attacks when target weights are unknown. Most existing approaches either craft image-wide perturbations or optimize patches for a single architecture, which limits their practicality and transferability. We introduce OmniPatch, a training framework for learning a universal adversarial patch that generalizes across images and both ViT and CNN architectures without requiring access to target model parameters.
Figures & tables
Figure 1: We apply the patch on the most sensitive class and use a two-stage regularized loss, weighting confident ViT pixels, then ViT-CNN ensembling via JS divergence and gradient alignment.
(a) Patched Image
Model
Clean Image mIoU
Random Patch mIoU
Baseline Patch mIoU
OmniPatch mIoU
mIoU Drop (%) Clean / Random/Baseline
PIDNet-S
0.8695
0.8651
0.7791
0.7299
16.05 / 15.62/ 6.31
PIDNet-M
0.8681
0.8618
0.8615
0.7393
14.84 / 14.22/ 14.18
PIDNet-L
0.9035
0.8996
0.8984
0.7530
16.65 / 16.30/ 16.18
BiSeNetv1
0.7149
0.7057
0.7120
0.6410
10.33 / 9.17/ 9.97
BiSeNetv2
0.6907
0.6845
0.6848
0.6036
12.61 / 11.81/ 11.85
SegFormer
0.7434
0.7431
-
0.6777
8.83 / 8.79/ -
Table 1: mIoU on Cityscapes, comparing OmniPatch against clean, random and baseline.
(a) Across different patches
Appendix figures & tables7 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 4: Class-wise Sensitivity Score across Cityscapes Dataset
Model
Clean Image
Random Patch
OmniPatch
PIDNet-S
0.869577
0.865101
0.729970
PIDNet-M
0.868144
0.861862
0.739300
PIDNet-L
0.903522
0.899625
0.753016
BiSeNetv1
0.714959
0.705789
0.641062
BiSeNetv2
0.690796
0.684500
0.603687
SegFormer
0.743495
0.743120
0.677788
Appendix
Table 2: Performance Comparison across Different Patch Attacks
Model
Patch 200 (1.9%)
Patch 300 (4.3%)
Patch 300 (7.6%)
PIDNet-S
0.729970
0.679634
0.597220
PIDNet-M
0.739300
0.682442
0.627030
PIDNet-L
0.753016
0.693860
0.646377
BiSeNetv1
0.641062
0.589184
0.535108
BiSeNetv2
0.603687
0.538712
0.502113
SegFormer
0.677788
0.658646
0.598823
Appendix
Table 3: Model Performance under varying Patch areas
Model
Center Placement
Random Placement
Sensitive Region (Ours)
PIDNet-S
0.829445
0.812880
0.729970
PIDNet-M
0.819404
0.804276
0.739300
PIDNet-L
0.854908
0.838226
0.753016
BiSeNetv1
0.668978
0.669475
0.641062
BiSeNetv2
0.641095
0.631650
0.603687
SegFormer
0.731485
0.725132
0.677788
Appendix
Table 4: Impact of Patch Placement Strategies on Model Robustness
Model
With KL divergence
With JS divergence (Ours)
PIDNet-S
0.746490
0.729970
PIDNet-M
0.746948
0.739300
PIDNet-L
0.766492
0.753016
BiSeNetv1
0.646691
0.641062
BiSeNetv2
0.606668
0.603687
SegFormer
0.708983
0.677788
Appendix
Table 5: Comparative Impact of KL and JS Divergence on Adversarial Patch Effectiveness
Model
Without Gradient Alignment
With Gradient Alginment (Ours)
PIDNet-S
0.777234
0.729970
PIDNet-M
0.765665
0.739300
PIDNet-L
0.786792
0.753016
BiSeNetv1
0.662936
0.641062
BiSeNetv2
0.627358
0.603687
SegFormer
0.680991
0.677788
Appendix
Table 6: Impact of gradient alignment on adversarial patch effecitveness (mIoU)
Semantic segmentation models are vulnerable to transferable adversarial perturbations, yet evaluating transfer attacks on dense prediction models can be computationally expensive. Existing ensemble attacks often rely on multiple surrogate models, increasing the computation cost, even harder for segmentation. This paper studies an efficient single-source alternative for transferable attacks on semantic segmentation. We formulate transferable attack composition as a chained computation over differentiable attack components, allowing the expensive source-model gradient computation to be shared. To reduce the update instability introduced by chained composition, we further use an integrated-gradient-style path-averaged direction as an empirical stabilization heuristic. Experiments on Pascal VOC and Cityscapes evaluate the resulting transferability efficiency trade-off across CNN- and transformer-based segmentation models. IGME achieves competitive transferability compared with single-source baselines and favorable runtime compared with model-ensemble attacks, while requiring access to only one source model.
Mengqi He, Jing Zhang
School of Computing, College of Systems & Society · The Australian National University, Canberra, ACT, Australia
Despite significant advances in computer vision, semantic segmentation models remain vulnerable to backdoor attacks, posing a security risk. These attacks redirect pixels of a chosen victim class to an attacker-specified target class when a trigger is present, while preserving clean predictions. Existing defenses are largely derived from image classification, while dedicated segmentation defenses remain scarce and typically require retraining or model modification. We introduce RePAIR, a post-hoc, label-free, attack-unaware defense based on the observation that backdoor-induced shifts can be stronger in the classifier head than in internal representations, leaving recoverable victim-class semantics. RePAIR infers the victim-target relation from an unlabeled, potentially contaminated image pool, constructs a safety-approved semantic reference, and localizes suspicious pixels by comparing head predictions with internal semantic evidence. It then applies feature-space and output corrections toward the inferred victim semantics, while conservative localization and output constraints limit changes to benign predictions. We model the attack as adversarial probability transport and repair as its approximate reversal, deriving bounds and sufficient conditions for localization, residual attack success, clean-side changes, defense-induced target predictions, and attack-unaware pair identification. Experiments across segmentation architectures and attack settings show that RePAIR substantially reduces attack success while largely preserving clean performance.
Transfer-based adversarial attacks often transfer poorly across heterogeneous architectures because CNNs favor local textures while Vision Transformers (ViTs) rely on global shapes. We propose Season, a spectrum-aware orthogonal gradient refinement framework for L-infinity transfer attacks against black-box target models on ImageNet, using a white-box surrogate. Season decomposes each update into a low-frequency branch capturing structural cues and a high-frequency branch capturing textures. A low-saliency guidance scheme reallocates high-frequency energy to background regions, preserving foreground structures that ViTs depend on. An orthogonal projection then forces the textural update to lie in the orthogonal complement of the structural direction, mitigating feature interference. As a training-free plug-and-play wrapper, Season enhances eight gradient-stabilization and input-enhancement attacks without modifying their cores. Across eight CNN, ViT, and MLP targets, Season improves transfer success rate by 6.6 percentage points on average and up to 16.0 points over strong baselines under a unified protocol.
Tianyi Wang, Zhenghao Gao, Shengjie Xu
Tongji University Shanghai, China · Huazhong University of Science and Technology · Wuhan LightRead Intelligent Technology Co., Ltd. Wuhan, China