Papers › Distance-IoU Loss: Faster and Better Learning for Bounding Box Regression

Distance-IoU Loss: Faster and Better Learning for Bounding Box Regression

19 Nov 2019arXiv:1911.08287archive 2025-07-28

Zhaohui Zheng, Ping Wang, Wei Liu, Jinze Li, Rongguang Ye, Dongwei Ren

Bounding box regression is the crucial step in object detection. In existing methods, while ℓₙ-norm loss is widely adopted for bounding box regression, it is not tailored to the evaluation metric, i.e., Intersection over Union (IoU). Recently, IoU loss and generalized IoU (GIoU) loss have been proposed to benefit the IoU metric, but still suffer from the problems of slow convergence and inaccurate regression. In this paper, we propose a Distance-IoU (DIoU) loss by incorporating the normalized distance between the predicted box and the target box, which converges much faster in training than IoU and GIoU losses. Furthermore, this paper summarizes three geometric factors in bounding box regression, \ie, overlap area, central point distance and aspect ratio, based on which a Complete IoU (CIoU) loss is proposed, thereby leading to faster convergence and better performance. By incorporating DIoU and CIoU losses into state-of-the-art object detection algorithms, e.g., YOLO v3, SSD and Faster RCNN, we achieve notable performance gains in terms of not only IoU metric but also GIoU metric. Moreover, DIoU can be easily adopted into non-maximum suppression (NMS) to act as the criterion, further boosting performance improvement. The source code and trained models are available at https://github.com/Zzh-tju/DIoU.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1911.08287")

Code

Syntology Ran 4 of 25 code samples harvested from 4 repositories linked to this paper; 21 have no recorded run. Of those that ran: 1 ran · honoured contract; 2 ran · our draft was wrong; 1 ran · fixture could not drive it.

By repository: community (archive-listed): 21 samples from 4 repositories, 1 ran; 4 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

20 repositories listed; official and paper-mentioned ones first.

Zzh-tju/DIoU officialmentioned in papermentioned on GitHubpytorch report
DataXujing/DIoU_YOLO_V3 mentioned on GitHubpaddleGPL-3.0 report
RuiminChen/GIou_loss_caffe mentioned on GitHub report
Zzh-tju/CIoU mentioned on GitHubpytorch report
Zzh-tju/DIoU-SSD-pytorch mentioned on GitHubpytorchGPL-3.0 report
Zzh-tju/DIoU-darknet mentioned on GitHubGPL-3.0 report
Zzh-tju/DIoU-pytorch-detectron mentioned on GitHubpytorchGPL-3.0 report
Zzh-tju/ultralytics-YOLOv3-Cluster-NMS mentioned on GitHubpytorch report
frgfm/Holocron mentioned on GitHubpytorch report
gau-nernst/CenterNet mentioned on GitHubpytorchMIT report
grifon-239/diploma mentioned on GitHubtfMIT report
hll110/DIoU-darknet-master mentioned on GitHubnot reachable when probed 2026-09-17 — repositories for recent papers often appear after camera-ready report
lilanxiao/Rotated_IoU mentioned on GitHubpytorch report
maudzung/Complex-YOLOv4-Pytorch mentioned on GitHubpytorchGPL-3.0 report
symoon94/YOLO-keras mentioned on GitHubtfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

25 samples harvested; 4 ran; 1 honoured the contract we drafted; 21 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
2ran · our draft was wrong
1ran · fixture could not drive it
21unverified

Licence: 6 of the 25 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 4 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

box2corners_th lilanxiao/Rotated_IoU/oriented_iou_loss.py community (archive-listed) ran · fixture could not drive it MIT (permissive) · e86bd8530459c52b · report
block grifon-239/diploma/common/backbones/efficientnet.py community (archive-listed) unverified MIT (permissive) · 1f6b117f42a0ded5 · report
box_diou grifon-239/diploma/yolo2/loss.py community (archive-listed) unverified MIT (permissive) · f1144ff6c0ba5dcd · report
box_giou grifon-239/diploma/yolo2/loss.py community (archive-listed) unverified MIT (permissive) · ae7bb59e3e00b67f · report
box_iou grifon-239/diploma/yolo2/loss.py community (archive-listed) unverified MIT (permissive) · 7ac8a3042b335d7e · report
box_iou grifon-239/diploma/yolo3/loss.py community (archive-listed) unverified MIT (permissive) · a432a967aa4de172 · report
channel_shuffle grifon-239/diploma/common/backbones/shufflenet.py community (archive-listed) unverified MIT (permissive) · 287a2f6bfef9fb01 · report
channel_shuffle grifon-239/diploma/common/backbones/shufflenet_v2.py community (archive-listed) unverified MIT (permissive) · e73a09a558400c49 · report
channel_split grifon-239/diploma/common/backbones/shufflenet_v2.py community (archive-listed) unverified MIT (permissive) · 9e94788335c24fb8 · report
ciou Zzh-tju/CIoU/layers/modules/multibox_loss.py community (archive-listed) unverified GPL-3.0 (copyleft) · pointer only · 3af5f4c25470e411 · report
correct_pad grifon-239/diploma/common/backbones/efficientnet.py community (archive-listed) unverified MIT (permissive) · 372c139f6aad1ede · report
diou Zzh-tju/CIoU/layers/modules/multibox_loss.py community (archive-listed) unverified GPL-3.0 (copyleft) · pointer only · 7faff7636d39a255 · report
fire_module grifon-239/diploma/common/backbones/squeezenet.py community (archive-listed) unverified MIT (permissive) · af81841b8f314e60 · report
relu grifon-239/diploma/common/backbones/mobilenet_v3.py community (archive-listed) unverified MIT (permissive) · d304c126a9501818 · report
shuffle_unit grifon-239/diploma/common/backbones/shufflenet_v2.py community (archive-listed) unverified MIT (permissive) · 6e40e2cdf90c6857 · report
sigmoid_focal_loss grifon-239/diploma/yolo3/loss.py community (archive-listed) unverified MIT (permissive) · 119b2c846dc6f0bd · report
softmax_focal_loss grifon-239/diploma/yolo3/loss.py community (archive-listed) unverified MIT (permissive) · a68a7dc12ee68dda · report
swish grifon-239/diploma/common/backbones/efficientnet.py community (archive-listed) unverified MIT (permissive) · d0b798e039050954 · report
yolo_correct_boxes symoon94/YOLO-keras/common/yolo_postprocess_np.py community (archive-listed) unverified MIT (permissive) · b4022b37b8e8571a · report
yolo_handle_predictions symoon94/YOLO-keras/common/yolo_postprocess_np.py community (archive-listed) unverified MIT (permissive) · 04f922be59ea74eb · report
yolo_head symoon94/YOLO-keras/common/yolo_postprocess_np.py community (archive-listed) unverified MIT (permissive) · 3ef2976bd580516f · report
floatn identical code first harvested elsewhere ran · honoured contract fingerprinted licence of this copy not recorded · ed702a199df9d0db · report
load_classes identical code first harvested elsewhere ran · our draft was wrong licence of this copy not recorded · fa99a26b6ba8f205 · report
unique_config_sections identical code first harvested elsewhere ran · our draft was wrong licence of this copy not recorded · 3b40b5666c482d42 · report
labels_to_class_weights identical code first harvested elsewhere unverified licence of this copy not recorded · 25f32f40bc0cba2f · report

Tasks

Object Detectionobject-detectionregression

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: DIoU-NMS

1x1 ConvolutionConvolutionDIoU-NMSNon Maximum SuppressionSSD

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections