BoxSnake: Polygonal Instance Segmentation with Box Supervision
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 code has been available publicly.
Code (1)
Tasks
Box-supervised Instance SegmentationInstance SegmentationSegmentationSemantic SegmentationSimilar Papers 제목 키워드 기반
Instance Segmentation With Mask-Supervised Polygonal Boundary Transformers
In this paper, we present an end-to-end instance segmentation method that regresses a polygonal boundary for each object instance. This sparse, vectorized boundary representation for objects, while attractive in many…
Instance SegmentationSegmentationSemantic SegmentationAdvancing SEM Based Nano-Scale Defect Analysis in Semiconductor Manufacturing for Advanced IC Nodes
In this research, we introduce a unified end-to-end Automated Defect Classification-Detection-Segmentation (ADCDS) framework for classifying, detecting, and segmenting multiple instances of semiconductor defects for adva…
Box-supervised Instance SegmentationDefect DetectionInstance SegmentationSegmentation+1PolarNeXt: Rethink Instance Segmentation with Polar Representation
One of the roadblocks for instance segmentation today is heavy computational overhead and model parameters. Previous methods based on Polar Representation made the initial mark to address this challenge by formulatin…
Instance SegmentationSegmentationSemantic SegmentationReal-time instance segmentation with polygons using an Intersection-over-Union loss
Predicting a binary mask for an object is more accurate but also more computationally expensive than a bounding box. Polygonal masks as developed in CenterPoly can be a good compromise. In this paper, we improve over Cen…
GPUInstance SegmentationReal-time Instance Segmentationregression+1Global Collinearity-aware Polygonizer for Polygonal Building Mapping in Remote Sensing
This paper addresses the challenge of mapping polygonal buildings from remote sensing images and introduces a novel algorithm, the Global Collinearity-aware Polygonizer (GCP). GCP, built upon an instance segmentation fra…
Instance SegmentationSemantic Segmentation