BREPS: Bounding-Box Robustness Evaluation of Promptable Segmentation
Andrey Moskalenko, Danil Kuznetsov, Irina Dudko, Anastasiia Iasakova, Nikita Boldyrev, Denis Shepelev, Andrei Spiridonov, Andrey Kuznetsov, Vlad Shakhuro
TL;DR
This paper investigates the robustness of promptable segmentation to real-world bounding-box prompts. It combines a large-scale real-user study (2,500 annotators, 25,000 bboxes) with a white-box adversarial framework (BREPS) that optimizes bounding-box prompts under a realism prior to test segmentation models across 10 datasets. The study reveals substantial inter-user variability and sensitivity to bbox perturbations, showing that tight bboxes often overestimate real-world performance, while small prompt changes can cause large IoU fluctuations. BREPS formalizes a scalable, realistic attack and demonstrates significant IoU degradation (≈$30\%$ on average under minimization) and limited gains under maximization, highlighting the need for robustness-aware training and evaluation in promptable segmentation. The work provides a dataset-driven realism prior (Gamma over CIoU-Loss) and a practical protocol, paving the way toward more reliable real-world deployment of bbox-guided segmentation systems.
Abstract
Promptable segmentation models such as SAM have established a powerful paradigm, enabling strong generalization to unseen objects and domains with minimal user input, including points, bounding boxes, and text prompts. Among these, bounding boxes stand out as particularly effective, often outperforming points while significantly reducing annotation costs. However, current training and evaluation protocols typically rely on synthetic prompts generated through simple heuristics, offering limited insight into real-world robustness. In this paper, we investigate the robustness of promptable segmentation models to natural variations in bounding box prompts. First, we conduct a controlled user study and collect thousands of real bounding box annotations. Our analysis reveals substantial variability in segmentation quality across users for the same model and instance, indicating that SAM-like models are highly sensitive to natural prompt noise. Then, since exhaustive testing of all possible user inputs is computationally prohibitive, we reformulate robustness evaluation as a white-box optimization problem over the bounding box prompt space. We introduce BREPS, a method for generating adversarial bounding boxes that minimize or maximize segmentation error while adhering to naturalness constraints. Finally, we benchmark state-of-the-art models across 10 datasets, spanning everyday scenes to medical imaging. Code - https://github.com/emb-ai/BREPS.
