{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/generalized-intersection-over-union-a-metric","title":"Generalized Intersection over Union: A Metric and A Loss for Bounding Box Regression","arxiv_id":"1902.09630","date":"2019-02-25","proceeding":"CVPR 2019 6","authors":["Hamid Rezatofighi","Nathan Tsoi","JunYoung Gwak","Amir Sadeghian","Ian Reid","Silvio Savarese"],"abstract":"Intersection over Union (IoU) is the most popular evaluation metric used in\nthe object detection benchmarks. However, there is a gap between optimizing the\ncommonly used distance losses for regressing the parameters of a bounding box\nand maximizing this metric value. The optimal objective for a metric is the\nmetric itself. In the case of axis-aligned 2D bounding boxes, it can be shown\nthat $IoU$ can be directly used as a regression loss. However, $IoU$ has a\nplateau making it infeasible to optimize in the case of non-overlapping\nbounding boxes. In this paper, we address the weaknesses of $IoU$ by\nintroducing a generalized version as both a new loss and a new metric. By\nincorporating this generalized $IoU$ ($GIoU$) as a loss into the state-of-the\nart object detection frameworks, we show a consistent improvement on their\nperformance using both the standard, $IoU$ based, and new, $GIoU$ based,\nperformance measures on popular object detection benchmarks such as PASCAL VOC\nand MS COCO.","url_abs":"http://arxiv.org/abs/1902.09630v2","url_pdf":"http://arxiv.org/pdf/1902.09630v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/AnselmC/bamot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/JaryHuang/awesome_SSD_FPN_GIoU","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/LinRiver/YOLOv3-on-LISA-Traffic-Sign-Detection-with-darknet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/RuiminChen/GIou_loss_caffe","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/RuiminChen/GIouloss_CIouloss_caffe","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/gau-nernst/CenterNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/kalubin-awym/GIoU-loss-for-RetinaNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/sremes/a2d2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/OFRIN/Tensorflow_GIoU","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"generalized-intersection-over-union-a-metric","repo_url":"https://github.com/PaddlePaddle/PaddleDetection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null}],"tasks":[{"task_slug":"object","task_name":"Object"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"object-detection-1","task_name":"object-detection"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.09630","atlas_url":"https://app.syntology.ai/?focus=1902.09630","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1902.09630"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.09630\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.09630"},"call":"get_concepts_for_paper(arxiv_id=\"1902.09630\")"}],"by_repo":[{"repo":"AnselmC/bamot","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"JaryHuang/awesome_SSD_FPN_GIoU","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1612.03144"],"harvested_for_calls":[{"arxiv_id":"1612.03144","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.03144"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.03144\")"}]},{"repo":"LinRiver/YOLOv3-on-LISA-Traffic-Sign-Detection-with-darknet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"RuiminChen/GIou_loss_caffe","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"RuiminChen/GIouloss_CIouloss_caffe","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"gau-nernst/CenterNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.04388"],"harvested_for_calls":[{"arxiv_id":"2006.04388","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.04388"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.04388\")"}]},{"repo":"kalubin-awym/GIoU-loss-for-RetinaNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sremes/a2d2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1505.04597"],"harvested_for_calls":[{"arxiv_id":"1505.04597","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.04597"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.04597\")"}]},{"repo":"OFRIN/Tensorflow_GIoU","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PaddlePaddle/PaddleDetection","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2203.16250"],"harvested_for_calls":[{"arxiv_id":"2203.16250","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.16250"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.16250\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"06b11bd9c772a6b603a357ec6c9ad32e1f0a05cd98b1dd5d7744e8094dc67d68","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}