{"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":"/method/iou-balanced-sampling","slug":"iou-balanced-sampling","name":"IoU-Balanced Sampling","full_name":"IoU-Balanced Sampling","full_name_withheld":false,"description_markdown":"**IoU-Balanced Sampling** is hard mining method for object detection. Suppose we need to sample $N$ negative samples from $M$ corresponding candidates. The selected probability for each sample under random sampling is:\r\n\r\n$$ p = \\frac{N}{M} $$\r\n\r\nTo raise the selected probability of hard negatives, we evenly split the sampling interval into $K$ bins according to IoU. $N$ demanded negative samples are equally distributed to each bin. Then we select samples from them uniformly. Therefore, we get the selected probability under IoU-balanced sampling:\r\n\r\n$$ p\\_{k} = \\frac{N}{K}*\\frac{1}{M\\_{k}}\\text{ , } k\\in\\left[0, K\\right)$$\r\n\r\nwhere $M\\_{k}$ is the number of sampling candidates in the corresponding interval denoted by $k$. $K$ is set to 3 by default in our experiments.\r\n\r\nThe sampled histogram with IoU-balanced sampling is shown by green color in the Figure to the right. The IoU-balanced sampling can guide the distribution of training samples close to the one of hard negatives.","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"http://arxiv.org/abs/1904.02701v1","title":"Libra R-CNN: Towards Balanced Learning for Object Detection","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/OceanPang/Libra_R-CNN/blob/c798fdd9b97b7b44bfdcd6b50b9f08600c6d5aca/mmdet/core/bbox/samplers/iou_balanced_neg_sampler.py#L7","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Prioritized Sampling","url":"/methods/category/prioritized-sampling","pwc_aliases":[]}],"n_papers_tagged":6,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"enhancing-tree-type-detection-in-forest-fire","title":"Enhancing Tree Type Detection in Forest Fire Risk Assessment: Multi-Stage Approach and Color Encoding with Forest Fire Risk Evaluation Framework for UAV Imagery","date":"2024-07-27","arxiv_id":"2407.19184","n_code_links":0,"syntology":null},{"paper":null,"slug":"online-progressive-instance-balanced-sampling","title":"Online progressive instance-balanced sampling for weakly supervised object detection","date":"2022-06-21","arxiv_id":"2206.10324","n_code_links":0,"syntology":null},{"paper":null,"slug":"fracture-detection-in-wrist-x-ray-images","title":"Fracture Detection in Wrist X-ray Images Using Deep Learning-Based Object Detection Models","date":"2021-11-14","arxiv_id":"2111.07355","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-balanced-learning-for-instance","title":"Towards Balanced Learning for Instance Recognition","date":"2021-08-23","arxiv_id":"2108.10175","n_code_links":0,"syntology":null},{"paper":null,"slug":"pbrnet-pyramidal-bounding-box-refinement-to","title":"PBRnet: Pyramidal Bounding Box Refinement to Improve Object Localization Accuracy","date":"2020-03-10","arxiv_id":"2003.04541","n_code_links":0,"syntology":null},{"paper":"/paper/libra-r-cnn-towards-balanced-learning-for","slug":"libra-r-cnn-towards-balanced-learning-for","title":"Libra R-CNN: Towards Balanced Learning for Object Detection","date":"2019-04-04","arxiv_id":"1904.02701","n_code_links":6,"syntology":null}],"papers_shown":6,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":6,"with_a_code_link":1,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":6,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/object-detection","name":"Object Detection","papers":4},{"task":"/task/object-detection-1","name":"object-detection","papers":4},{"task":"/task/ensemble-learning","name":"Ensemble Learning","papers":1},{"task":"/task/fire-detection","name":"Fire Detection","papers":1},{"task":"/task/fracture-detection","name":"Fracture detection","papers":1},{"task":"/task/management","name":"Management","papers":1},{"task":"/task/medical-object-detection","name":"Medical Object Detection","papers":1},{"task":"/task/object-localization","name":"Object Localization","papers":1},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":1},{"task":"/task/weakly-supervised-object-detection","name":"Weakly Supervised Object Detection","papers":1}],"tasks_shown":10,"n_tasks":10,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":1},{"year":"2021","papers":2},{"year":"2022","papers":1},{"year":"2024","papers":1}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/iou-balanced-sampling"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=IoU-Balanced%20Sampling","read_at":"2026-10-05T00:58:08+00:00","query":"IoU-Balanced Sampling","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'IoU-Balanced Sampling' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["balanced contact sampling","balanced sampling estimator","Multi-Domain Balanced Sampling","Balanced Iteration Subsampling (BIS)","balanced I-optimal sampling algorithm","Alternating Class-Balanced Sampling (ACBS)","Prediction-balanced Reservoir Sampling (PBRS)","Balanced Class-Agnostic Sampling (B-CAS) strategy"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"971e5115df595496f22c292173ab6a7e21214347628e043b354847d65ead2a55","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}