arXiv:2608.11285cs.CVcs.AI2026-08

提出新方法提升分割模型的稀疏攻击效率

SegPAR: Class-Centric Decision-Based Sparse Attack for Semantic Segmentation

论文配图:SegPAR: Class-Centric Decision-Based Sparse Attack for Semantic Segmentation
图 1 · 摘自论文原文
  • 从像素级转向类别中心探索,减少无效查询
  • 在仅使用5%像素时使平均交并比下降41.2%
  • 适合研究对抗攻击与模型安全的开发者

尽管稀疏决策型黑盒攻击在语义分割领域具有实际意义,但研究仍不充分。本文将分类任务中最具代表性的稀疏决策型黑盒攻击方法迁移至分割任务,建立严谨基准。实验发现,现有方法因图像中心的像素累积策略导致查询效率低下,快速耗尽查询预算。为此,我们提出SegPAR,一种全新的决策型框架,采用类别中心探索范式,并引入差异奖励机制以消除标准决策奖励带来的误导性反馈。大量实验表明,SegPAR在稀疏性效率和MIoU降低方面显著优于黑盒基线,且与白盒稀疏攻击性能相当。代码已开源。

原文摘要 · Abstract (English)

Despite the practical relevance of sparse decision-based black-box threats, they have received limited attention in semantic segmentation. To bridge this gap, we adapt the most representative decision-based black-box sparse attacks from the classification domain to serve as baselines, establishing a rigorous benchmark for this underexplored setting. In this context, we demonstrate that one of the existing methods suffers from severe query inefficiency due to its image-centric pixel accumulation, which rapidly exhausts query budgets across the vast image space. To overcome this, we propose SegPAR, a novel decision-based framework that shifts to a class-centric exploration paradigm. Furthermore, to eliminate the misleading feedback generated by standard decision rewards during pixel accumulation, we introduce a novel discrepancy reward. Extensive experiments show that SegPAR significantly outperforms black-box baselines in sparsity efficiency and MIoU reduction, while remaining competitive with white-box sparse attacks. Code is available at \href{https://github.com/KAU-QuantumAILab/SegPAR}{https://github.com/KAU-QuantumAILab/SegPAR}.

对抗攻击语义分割稀疏攻击

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。