Directly Optimizing IoU for Bounding Box Localization
- URL: http://arxiv.org/abs/2304.07256v1
- Date: Fri, 14 Apr 2023 17:08:12 GMT
- Title: Directly Optimizing IoU for Bounding Box Localization
- Authors: Mofassir ul Islam Arif, Mohsan Jameel, and Lars Schmidt-Thieme
- Abstract summary: This paper presents a novel method to maximize the detection of bounding boxes for the bounding boxes.
The Smooth IoU method has shown performance gains over the standard Huber loss.
It has been evaluated on the Oxford IIIT, Udacity self-driving car, PA Pets Union, and VWFS Car Damage datasets.
- Score: 5.018156030818881
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Object detection has seen remarkable progress in recent years with the
introduction of Convolutional Neural Networks (CNN). Object detection is a
multi-task learning problem where both the position of the objects in the
images as well as their classes needs to be correctly identified. The idea here
is to maximize the overlap between the ground-truth bounding boxes and the
predictions i.e. the Intersection over Union (IoU). In the scope of work seen
currently in this domain, IoU is approximated by using the Huber loss as a
proxy but this indirect method does not leverage the IoU information and treats
the bounding box as four independent, unrelated terms of regression. This is
not true for a bounding box where the four coordinates are highly correlated
and hold a semantic meaning when taken together. The direct optimization of the
IoU is not possible due to its non-convex and non-differentiable nature. In
this paper, we have formulated a novel loss namely, the Smooth IoU, which
directly optimizes the IoUs for the bounding boxes. This loss has been
evaluated on the Oxford IIIT Pets, Udacity self-driving car, PASCAL VOC, and
VWFS Car Damage datasets and has shown performance gains over the standard
Huber loss.
Related papers
- Unified-IoU: For High-Quality Object Detection [1.62877896907106]
We propose a new IoU loss function, called Unified-IoU (UIoU), which is more concerned with the weight assignment between different quality prediction boxes.
Our proposed method achieves better performance on multiple datasets, especially at a high IoU threshold.
arXiv Detail & Related papers (2024-08-13T04:56:45Z) - 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) - Knowledge Combination to Learn Rotated Detection Without Rotated
Annotation [53.439096583978504]
Rotated bounding boxes drastically reduce output ambiguity of elongated objects.
Despite the effectiveness, rotated detectors are not widely employed.
We propose a framework that allows the model to predict precise rotated boxes.
arXiv Detail & Related papers (2023-04-05T03:07:36Z) - Rethinking IoU-based Optimization for Single-stage 3D Object Detection [103.83141677242871]
We propose a Rotation-Decoupled IoU (RDIoU) method that can mitigate the rotation-sensitivity issue.
Our RDIoU simplifies the complex interactions of regression parameters by decoupling the rotation variable as an independent term.
arXiv Detail & Related papers (2022-07-19T15:35:23Z) - Decoupled IoU Regression for Object Detection [31.9114940121939]
Non-maximum suppression (NMS) is widely used in object detection pipelines for removing duplicated bounding boxes.
Inconsistency between the confidence for NMS and the real localization confidence seriously affects detection performance.
We propose a novel Decoupled IoU Regression model to handle these problems.
arXiv Detail & Related papers (2022-02-02T04:01:11Z) - Distribution-aware Margin Calibration for Semantic Segmentation in
Images [78.65312390695038]
Jaccard index, also known as Intersection-over-Union (IoU), is one of the most critical evaluation metrics in image semantic segmentation.
Direct optimization of IoU score is very difficult because the learning objective is neither differentiable nor decomposable.
We propose a margin calibration method, which can be directly used as a learning objective, for an improved generalization of IoU over the data-distribution.
arXiv Detail & Related papers (2021-12-21T22:38:25Z) - A Systematic IoU-Related Method: Beyond Simplified Regression for Better
Localization [9.036025934093965]
We propose a new metric, the extended IoU, which is well-defined when two boxes are not overlapping and reduced to the standard IoU when overlapping.
Thirdly, we propose a steady optimization technique (SOT) to make the fractional EIoU loss approaching the minimum more steadily and smoothly.
arXiv Detail & Related papers (2021-12-03T09:00:55Z) - Momentum Contrastive Autoencoder: Using Contrastive Learning for Latent
Space Distribution Matching in WAE [51.09507030387935]
Wasserstein autoencoder (WAE) shows that matching two distributions is equivalent to minimizing a simple autoencoder (AE) loss under the constraint that the latent space of this AE matches a pre-specified prior distribution.
We propose to use the contrastive learning framework that has been shown to be effective for self-supervised representation learning, as a means to resolve this problem.
We show that using the contrastive learning framework to optimize the WAE loss achieves faster convergence and more stable optimization compared with existing popular algorithms for WAE.
arXiv Detail & Related papers (2021-10-19T22:55:47Z) - Adaptive Anomaly Detection for Internet of Things in Hierarchical Edge
Computing: A Contextual-Bandit Approach [81.5261621619557]
We propose an adaptive anomaly detection scheme with hierarchical edge computing (HEC)
We first construct multiple anomaly detection DNN models with increasing complexity, and associate each of them to a corresponding HEC layer.
Then, we design an adaptive model selection scheme that is formulated as a contextual-bandit problem and solved by using a reinforcement learning policy network.
arXiv Detail & Related papers (2021-08-09T08:45:47Z) - 3D IoU-Net: IoU Guided 3D Object Detector for Point Clouds [68.44740333471792]
We add a 3D IoU prediction branch to the regular classification and regression branches.
We propose a 3D IoU-Net with IoU sensitive feature learning and an IoU alignment operation.
The experimental results on the KITTI car detection benchmark show that 3D IoU-Net with IoU perception achieves state-of-the-art performance.
arXiv Detail & Related papers (2020-04-10T09:24:29Z)
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.