2022
DOI: 10.1609/aaai.v36i3.20214
|View full text |Cite
|
Sign up to set email alerts
|

Polygon-to-Polygon Distance Loss for Rotated Object Detection

Abstract: There are two key issues that limit further improvements in the performance of existing rotational detectors: 1) Periodic sudden change of the parameters in the rotating bounding box (RBBox) definition causes a numerical discontinuity in the loss (such as smoothL1 loss). 2) There is a gap of optimization asynchrony between the loss in the RBBox regression and evaluation metrics. In this paper, we define a new distance formulation between two convex polygons describing the overlapping degree and non-overlapping… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
31
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 40 publications
(55 citation statements)
references
References 36 publications
(45 reference statements)
0
31
0
Order By: Relevance
“…First, to avoid the boundary problem, we follow the GWD 11 to convert the oriented bounding box Bðx; y; w; h; θÞ into 2-D Gaussian distributions Nðμ; ΣÞ as follows:…”
Section: Modulated Kalman Intersection Over Union Lossmentioning
confidence: 99%
See 2 more Smart Citations
“…First, to avoid the boundary problem, we follow the GWD 11 to convert the oriented bounding box Bðx; y; w; h; θÞ into 2-D Gaussian distributions Nðμ; ΣÞ as follows:…”
Section: Modulated Kalman Intersection Over Union Lossmentioning
confidence: 99%
“…Some current methods 11 13 model the oriented bounding box into Gaussian distributions [see Eq. (1)] and then use the distance measure in statistics (such as Wassertein distance, 14 Kullback–Leibler divergence, 15 and Bhattacharyya distance 16 ) to calculate the similarity, effectively avoiding the boundary problems.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…SCRDet [2] combines SkewIoU and Smooth L1 loss to develop an IoU-Smooth L1 loss, which partly circumvents the need for differentiable SkewIoU loss. Polygon-to-Polygon distance loss [46] is derived from the area sum of triangles specified by the vertexes of one polygon and the edges of the other. KFIoU [47] achieves a trend-level alignment with SkewIoU by Gaussian modeling and Kalman filtering.…”
Section: Inconsistency Between Metric and Rotation Lossmentioning
confidence: 99%
“…There are so many researches are devoted to the object detection of remote sensing images, such as the ReDet [1], GWD [2], S2A-Net [3]. Most object detection methods involve classification, but the categories are limited to coarsegrained classifications, such as airplanes, ships and so on.…”
Section: Introductionmentioning
confidence: 99%