SCALoss: Side and Corner Aligned Loss for Bounding Box Regression

• URL: http://arxiv.org/abs/2104.00462v1
• Date: Thu, 1 Apr 2021 13:46:35 GMT
• Title: SCALoss: Side and Corner Aligned Loss for Bounding Box Regression
• Authors: Tu Zheng, Shuai Zhao, Yang Liu, Zili Liu, Deng Cai
• Abstract summary: We propose Side Overlap (SO) loss by maximizing the side overlap of two bounding boxes, which puts more penalty for low overlapping bounding box cases. To speed up the convergence, the Corner Distance (CD) is added into the objective function. We get a new regression objective function, Side and Corner Align Loss (SCALoss)
• Score: 29.275260127860783
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bounding box regression is an important component in object detection. Recent work has shown the promising performance by optimizing the Intersection over Union (IoU) as loss. However, IoU-based loss has the gradient vanish problem in the case of low overlapping bounding boxes, and the model could easily ignore these simple cases. In this paper, we propose Side Overlap (SO) loss by maximizing the side overlap of two bounding boxes, which puts more penalty for low overlapping bounding box cases. Besides, to speed up the convergence, the Corner Distance (CD) is added into the objective function. Combining the Side Overlap and Corner Distance, we get a new regression objective function, Side and Corner Align Loss (SCALoss). The SCALoss is well-correlated with IoU loss, which also benefits the evaluation metric but produces more penalty for low-overlapping cases. It can serve as a comprehensive similarity measure, leading the better localization performance and faster convergence speed. Experiments on COCO and PASCAL VOC benchmarks show that SCALoss can bring consistent improvement and outperform $\ell_n$ loss and IoU based loss with popular object detectors such as YOLOV3, SSD, Reppoints, Faster-RCNN.

Related papers

• FPDIoU Loss: A Loss Function for Efficient Bounding Box Regression of Rotated Object Detection [10.655167287088368]
  We propose a novel metric for arbitrary shapes comparison based on minimum points distance. $FPDIoU$ loss has been applied to state-of-the-art rotated object detection.
  arXiv  Detail & Related papers  (2024-05-16T09:44:00Z)
• Shadow: A Novel Loss Function for Efficient Training in Siamese Networks [2.2189125306342]
  We present a novel loss function called Shadow Loss that compresses the dimensions of an embedding space during loss calculation without loss of performance. Projecting on a lower-dimension projection space, our loss function converges faster, and the resulting classified image clusters have higher inter-class and smaller intra-class distances. Shadow Loss consistently performs better than the state-of-the-art Triplet Margin Loss by an accuracy of 5%-10% across diverse datasets.
  arXiv  Detail & Related papers  (2023-11-23T14:07:35Z)
• Inner-IoU: More Effective Intersection over Union Loss with Auxiliary Bounding Box [10.03001043843768]
  We propose Inner-IoU loss, which calculates IoU loss through auxiliary bounding boxes. For different datasets and detectors, we introduce a scaling factor ratio to control the scale size of the auxiliary bounding boxes. Finally, integrate Inner-IoU into the existing IoU-based loss functions for simulation and comparative experiments.
  arXiv  Detail & Related papers  (2023-11-06T05:14:24Z)
• MPDIoU: A Loss for Efficient and Accurate Bounding Box Regression [0.0]
  We propose a novel bounding box similarity comparison metric MPDIoU. The MPDIoU loss function is applied to state-of-the-art instance segmentation (e.g., YOLACT) and object detection (e.g., YOLOv7) model trained on PASCAL VOC, MS COCO, and IIIT5k.
  arXiv  Detail & Related papers  (2023-07-14T23:54:49Z)
• Intersection over Union with smoothing for bounding box regression [0.0]
  We focus on the construction of a loss function for the bounding box regression. The Intersection over Union (IoU) metric is improved to converge faster. We experimentally show that the proposed loss function is robust with respect to the noise in the dimension of ground truth bounding boxes.
  arXiv  Detail & Related papers  (2023-03-27T10:20:34Z)
• The KFIoU Loss for Rotated Object Detection [115.334070064346]
  In this paper, we argue that one effective alternative is to devise an approximate loss who can achieve trend-level alignment with SkewIoU loss. Specifically, we model the objects as Gaussian distribution and adopt Kalman filter to inherently mimic the mechanism of SkewIoU. The resulting new loss called KFIoU is easier to implement and works better compared with exact SkewIoU.
  arXiv  Detail & Related papers  (2022-01-29T10:54:57Z)
• Alpha-IoU: A Family of Power Intersection over Union Losses for Bounding Box Regression [59.72580239998315]
  We generalize existing IoU-based losses to a new family of power IoU losses that have a power IoU term and an additional power regularization term. Experiments on multiple object detection benchmarks and models demonstrate that $alpha$-IoU losses can surpass existing IoU-based losses by a noticeable performance margin.
  arXiv  Detail & Related papers  (2021-10-26T13:09:20Z)
• Focal and Efficient IOU Loss for Accurate Bounding Box Regression [63.14659624634066]
  In object detection, bounding box regression (BBR) is a crucial step that determines the object localization performance. Most previous loss functions for BBR have two main drawbacks: (i) Both $ell_n$-norm and IOU-based loss functions are inefficient to depict the objective of BBR, which leads to slow convergence and inaccurate regression results.
  arXiv  Detail & Related papers  (2021-01-20T14:33:58Z)
• SADet: Learning An Efficient and Accurate Pedestrian Detector [68.66857832440897]
  This paper proposes a series of systematic optimization strategies for the detection pipeline of one-stage detector. It forms a single shot anchor-based detector (SADet) for efficient and accurate pedestrian detection. Though structurally simple, it presents state-of-the-art result and real-time speed of $20$ FPS for VGA-resolution images.
  arXiv  Detail & Related papers  (2020-07-26T12:32:38Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)
• Enhancing Geometric Factors in Model Learning and Inference for Object Detection and Instance Segmentation [91.12575065731883]
  We propose Complete-IoU (CIoU) loss and Cluster-NMS for enhancing geometric factors in both bounding box regression and Non-Maximum Suppression (NMS) The training of deep models using CIoU loss results in consistent AP and AR improvements in comparison to widely adopted $ell_n$-norm loss and IoU-based loss. Cluster-NMS is very efficient due to its pure GPU implementation, and geometric factors can be incorporated to improve both AP and AR.
  arXiv  Detail & Related papers  (2020-05-07T16:00:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.