BoxSnake: Polygonal Instance Segmentation with Box Supervision

Rui Yang, Lin Song, Yixiao Ge, Xiu Li
2/14/2026

No official code found. Best implementation: Yangr116/BoxSnake (66 stars, Apache-2.0, last commit 2024-05-28).

Abstract

Box-supervised instance segmentation has gained much attention as it requires only simple box annotations instead of costly mask or polygon annotations. However, existing box-supervised instance segmentation models mainly focus on mask-based frameworks. We propose a new end-to-end training technique, termed BoxSnake, to achieve effective polygonal instance segmentation using only box annotations for the first time. Our method consists of two loss functions: (1) a point-based unary loss that constrains the bounding box of predicted polygons to achieve coarse-grained segmentation; and (2) a distance-aware pairwise loss that encourages the predicted polygons to fit the object boundaries. Compared with the mask-based weakly-supervised methods, BoxSnake further reduces the performance gap between the predicted segmentation and the bounding box, and shows significant superiority on the Cityscapes dataset. The source code has been available at https://github.com/Yangr116/BoxSnake.

View on arXivView PDF

Code Implementations(1)

Yangr116/BoxSnakeCommunity100%
Apache-2.0

[ICCV 2023] BoxSnake official repository.

666C++, CudaMar 17, 20232 years agoApache-2.0
instance-segmentationpolygonsegmentation

Similar Papers

Cite this paper

@article{yang2026boxsnake,
  title  = {BoxSnake: Polygonal Instance Segmentation with Box Supervision},
  author = {Rui Yang and Lin Song and Yixiao Ge and Xiu Li},
  year   = {2026},
  eprint = {2303.11630},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2303.11630},
  journal = {ICCV 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.11630.svg)](https://codeofpaper.com/paper/2303.11630)

Discussion