{"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/scale-aware-fast-r-cnn-for-pedestrian","title":"Scale-aware Fast R-CNN for Pedestrian Detection","arxiv_id":"1510.08160","date":"2015-10-28","proceeding":null,"authors":["Jianan Li","Xiaodan Liang","ShengMei Shen","Tingfa Xu","Jiashi Feng","Shuicheng Yan"],"abstract":"In this work, we consider the problem of pedestrian detection in natural\nscenes. Intuitively, instances of pedestrians with different spatial scales may\nexhibit dramatically different features. Thus, large variance in instance\nscales, which results in undesirable large intra-category variance in features,\nmay severely hurt the performance of modern object instance detection methods.\nWe argue that this issue can be substantially alleviated by the\ndivide-and-conquer philosophy. Taking pedestrian detection as an example, we\nillustrate how we can leverage this philosophy to develop a Scale-Aware Fast\nR-CNN (SAF R-CNN) framework. The model introduces multiple built-in\nsub-networks which detect pedestrians with scales from disjoint ranges. Outputs\nfrom all the sub-networks are then adaptively combined to generate the final\ndetection results that are shown to be robust to large variance in instance\nscales, via a gate function defined over the sizes of object proposals.\nExtensive evaluations on several challenging pedestrian detection datasets well\ndemonstrate the effectiveness of the proposed SAF R-CNN. Particularly, our\nmethod achieves state-of-the-art performance on Caltech, INRIA, and ETH, and\nobtains competitive results on KITTI.","url_abs":"http://arxiv.org/abs/1510.08160v3","url_pdf":"http://arxiv.org/pdf/1510.08160v3.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":"pedestrian-detection","task_name":"Pedestrian Detection"},{"task_slug":"philosophy","task_name":"Philosophy"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/pedestrian-detection-on-caltech","task":"Pedestrian Detection","dataset":"Caltech","model":"SA-FastRCNN","rank_in_archive_order":23,"of":33,"metrics":{"Reasonable Miss Rate":"9.68"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1510.08160","atlas_url":"https://app.syntology.ai/?focus=1510.08160","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":"1510.08160"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1510.08160\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1510.08160"},"call":"get_concepts_for_paper(arxiv_id=\"1510.08160\")"}],"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":"470d6957dd3328a6ce3c3a5cc2d61173df34e2b3a8a01cb1c8c98f8b50795aed","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}