# Proximal Splitting Adversarial Attacks for Semantic Segmentation

Source: [Proximal Splitting Adversarial Attacks for Semantic Segmentation](<https://www.sota2.com/research/paper/68fa6ef11e209131cea43107>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T01:10:39.531Z

Authors: J\\'er\\^ome Rony, Jean-Christophe Pesquet, Ismail Ben Ayed

Published: 2022-06-14T21:23:02.000Z

## Abstract

Classification has been the focal point of research on adversarial attacks, but only a few works investigate methods suited to denser prediction tasks, such as semantic segmentation. The methods proposed in these works do not accurately solve the adversarial segmentation problem and, therefore, overestimate the size of the perturbations required to fool models. Here, we propose a white-box attack for these models based on a proximal splitting to produce adversarial perturbations with much smaller $\\ell\_\\infty$ norms. Our attack can handle large numbers of constraints within a nonconvex minimization framework via an Augmented Lagrangian approach, coupled with adaptive constraint scaling and masking strategies. We demonstrate that our attack significantly outperforms previously proposed ones, as well as classification attacks that we adapted for segmentation, providing a first comprehensive benchmark for this dense task.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2206.07179>)

[PDF](<https://arxiv.org/pdf/2206.07179.pdf>)
