{"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/boxsup-exploiting-bounding-boxes-to-supervise","title":"BoxSup: Exploiting Bounding Boxes to Supervise Convolutional Networks for Semantic Segmentation","arxiv_id":"1503.01640","date":"2015-03-05","proceeding":"ICCV 2015 12","authors":["Jifeng Dai","Kaiming He","Jian Sun"],"abstract":"Recent leading approaches to semantic segmentation rely on deep convolutional\nnetworks trained with human-annotated, pixel-level segmentation masks. Such\npixel-accurate supervision demands expensive labeling effort and limits the\nperformance of deep networks that usually benefit from more training data. In\nthis paper, we propose a method that achieves competitive accuracy but only\nrequires easily obtained bounding box annotations. The basic idea is to iterate\nbetween automatically generating region proposals and training convolutional\nnetworks. These two steps gradually recover segmentation masks for improving\nthe networks, and vise versa. Our method, called BoxSup, produces competitive\nresults supervised by boxes only, on par with strong baselines fully supervised\nby masks under the same setting. By leveraging a large amount of bounding\nboxes, BoxSup further unleashes the power of deep convolutional networks and\nyields state-of-the-art results on PASCAL VOC 2012 and PASCAL-CONTEXT.","url_abs":"http://arxiv.org/abs/1503.01640v2","url_pdf":"http://arxiv.org/pdf/1503.01640v2.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":[],"tasks":[{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/semantic-segmentation-on-pascal-context","task":"Semantic Segmentation","dataset":"PASCAL Context","model":"BoxSup","rank_in_archive_order":60,"of":66,"metrics":{"mIoU":"40.5"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-pascal-voc-2012","task":"Semantic Segmentation","dataset":"PASCAL VOC 2012 test","model":"BoxSup","rank_in_archive_order":46,"of":51,"metrics":{"Mean IoU":"64.6%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1503.01640","atlas_url":"https://app.syntology.ai/?focus=1503.01640","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":"1503.01640"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1503.01640\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1503.01640"},"call":"get_concepts_for_paper(arxiv_id=\"1503.01640\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b448dfb5c7a66ead3800298f008cb5728f6174c5c3aad4a169a0af0924240846","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}