{"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/light-head-r-cnn-in-defense-of-two-stage","title":"Light-Head R-CNN: In Defense of Two-Stage Object Detector","arxiv_id":"1711.07264","date":"2017-11-20","proceeding":null,"authors":["Zeming Li","Chao Peng","Gang Yu","Xiangyu Zhang","Yangdong Deng","Jian Sun"],"abstract":"In this paper, we first investigate why typical two-stage methods are not as\nfast as single-stage, fast detectors like YOLO and SSD. We find that Faster\nR-CNN and R-FCN perform an intensive computation after or before RoI warping.\nFaster R-CNN involves two fully connected layers for RoI recognition, while\nR-FCN produces a large score maps. Thus, the speed of these networks is slow\ndue to the heavy-head design in the architecture. Even if we significantly\nreduce the base model, the computation cost cannot be largely decreased\naccordingly.\n  We propose a new two-stage detector, Light-Head R-CNN, to address the\nshortcoming in current two-stage approaches. In our design, we make the head of\nnetwork as light as possible, by using a thin feature map and a cheap R-CNN\nsubnet (pooling and single fully-connected layer). Our ResNet-101 based\nlight-head R-CNN outperforms state-of-art object detectors on COCO while\nkeeping time efficiency. More importantly, simply replacing the backbone with a\ntiny network (e.g, Xception), our Light-Head R-CNN gets 30.7 mmAP at 102 FPS on\nCOCO, significantly outperforming the single-stage, fast detectors like YOLO\nand SSD on both speed and accuracy. Code will be made publicly available.","url_abs":"http://arxiv.org/abs/1711.07264v2","url_pdf":"http://arxiv.org/pdf/1711.07264v2.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":"light-head-r-cnn-in-defense-of-two-stage","repo_url":"https://github.com/makefile/frcnn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"light-head-r-cnn-in-defense-of-two-stage","repo_url":"https://github.com/princefr/Light-Head.pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"light-head-r-cnn-in-defense-of-two-stage","repo_url":"https://github.com/rickyHong/pytorch-light-head-rcnn-repl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"light-head-r-cnn-in-defense-of-two-stage","repo_url":"https://github.com/MindCode-4/code-7/tree/main/light-head","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"light-head-r-cnn-in-defense-of-two-stage","repo_url":"https://github.com/reeered/light-head","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"two","task_name":"Vocal Bursts Valence Prediction"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"non-maximum-suppression","method_name":"Non Maximum Suppression"},{"method_slug":"position-sensitive-roi-pooling","method_name":"Position-Sensitive RoI Pooling"},{"method_slug":"r-cnn","method_name":"R-CNN"},{"method_slug":"r-fcn","method_name":"R-FCN"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"speed","method_name":"SPEED"},{"method_slug":"ssd","method_name":"SSD"},{"method_slug":"svm","method_name":"SVM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.07264","atlas_url":"https://app.syntology.ai/?focus=1711.07264","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":"1711.07264"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.07264\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.07264"},"call":"get_concepts_for_paper(arxiv_id=\"1711.07264\")"}],"by_repo":[{"repo":"makefile/frcnn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"princefr/Light-Head.pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"rickyHong/pytorch-light-head-rcnn-repl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindCode-4/code-7","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2407.00342"],"harvested_for_calls":[{"arxiv_id":"2407.00342","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.00342"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.00342\")"}]},{"repo":"reeered/light-head","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"2da0a5808c00ef65a11b8ebfa90a8fc4350ca30509ec1a89894db8d3b7f586b9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}