InterpIoU: Rethinking Bounding Box Regression with Interpolation-Based IoU Optimization

• URL: http://arxiv.org/abs/2507.12420v1
• Date: Wed, 16 Jul 2025 17:09:04 GMT
• Title: InterpIoU: Rethinking Bounding Box Regression with Interpolation-Based IoU Optimization
• Authors: Haoyuan Liu, Hiroshi Watanabe,
• Abstract summary: We propose InterpIoU, a novel loss function that replaces handcrafted geometric penalties with a term based on the IoU between interpolated boxes and the target.<n>We show that our methods consistently outperform state-of-the-art IoU-based losses across various detection frameworks.
• Score: 0.5912856130403417
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bounding box regression (BBR) is fundamental to object detection, where the regression loss is crucial for accurate localization. Existing IoU-based losses often incorporate handcrafted geometric penalties to address IoU's non-differentiability in non-overlapping cases and enhance BBR performance. However, these penalties are sensitive to box shape, size, and distribution, often leading to suboptimal optimization for small objects and undesired behaviors such as bounding box enlargement due to misalignment with the IoU objective. To address these limitations, we propose InterpIoU, a novel loss function that replaces handcrafted geometric penalties with a term based on the IoU between interpolated boxes and the target. By using interpolated boxes to bridge the gap between predictions and ground truth, InterpIoU provides meaningful gradients in non-overlapping cases and inherently avoids the box enlargement issue caused by misaligned penalties. Simulation results further show that IoU itself serves as an ideal regression target, while existing geometric penalties are both unnecessary and suboptimal. Building on InterpIoU, we introduce Dynamic InterpIoU, which dynamically adjusts interpolation coefficients based on IoU values, enhancing adaptability to scenarios with diverse object distributions. Experiments on COCO, VisDrone, and PASCAL VOC show that our methods consistently outperform state-of-the-art IoU-based losses across various detection frameworks, with particularly notable improvements in small object detection, confirming their effectiveness.

Related papers

• The Larger the Merrier? Efficient Large AI Model Inference in Wireless Edge Networks [56.37880529653111]
  The demand for large computation model (LAIM) services is driving a paradigm shift from traditional cloud-based inference to edge-based inference for low-latency, privacy-preserving applications.<n>In this paper, we investigate the LAIM-inference scheme, where a pre-trained LAIM is pruned and partitioned into on-device and on-server sub-models for deployment.
  arXiv  Detail & Related papers  (2025-05-14T08:18:55Z)
• Marginalized Generalized IoU (MGIoU): A Unified Objective Function for Optimizing Any Convex Parametric Shapes [32.1114758137734]
  Marginalized Generalized IoU (MGIoU) is a novel loss function that overcomes challenges by projecting structured convex shapes onto their unique shape Normals to compute one-dimensional normalized GIoU.<n>Experiments on standard benchmarks demonstrate that MGIoU and MGIoU+ consistently outperform existing losses while reducing loss latency by 10-40x.
  arXiv  Detail & Related papers  (2025-04-23T06:05:39Z)
• 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)
• 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)
• 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)
• 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)
• 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)
• Discriminator-Free Generative Adversarial Attack [87.71852388383242]
  Agenerative-based adversarial attacks can get rid of this limitation. ASymmetric Saliency-based Auto-Encoder (SSAE) generates the perturbations. The adversarial examples generated by SSAE not only make thewidely-used models collapse, but also achieves good visual quality.
  arXiv  Detail & Related papers  (2021-07-20T01:55:21Z)
• PIoU Loss: Towards Accurate Oriented Object Detection in Complex Environments [33.27663718573774]
  An oriented bounding box (OBB) can better target rotated objects by reducing the overlap with background areas. Existing OBB approaches are mostly built on horizontal bounding box detectors by introducing an additional dimension optimized by a distance loss. A novel loss, Pixels-IoU (PIoU) Loss, is formulated to exploit both the angle and IoU for accurate OBB regression.
  arXiv  Detail & Related papers  (2020-07-19T03:51:59Z)

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.