{"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/learning-complexity-aware-cascades-for-deep","title":"Learning Complexity-Aware Cascades for Deep Pedestrian Detection","arxiv_id":"1507.05348","date":"2015-07-19","proceeding":"ICCV 2015 12","authors":["Zhaowei Cai","Mohammad Saberian","Nuno Vasconcelos"],"abstract":"The design of complexity-aware cascaded detectors, combining features of very\ndifferent complexities, is considered. A new cascade design procedure is\nintroduced, by formulating cascade learning as the Lagrangian optimization of a\nrisk that accounts for both accuracy and complexity. A boosting algorithm,\ndenoted as complexity aware cascade training (CompACT), is then derived to\nsolve this optimization. CompACT cascades are shown to seek an optimal\ntrade-off between accuracy and complexity by pushing features of higher\ncomplexity to the later cascade stages, where only a few difficult candidate\npatches remain to be classified. This enables the use of features of vastly\ndifferent complexities in a single detector. In result, the feature pool can be\nexpanded to features previously impractical for cascade design, such as the\nresponses of a deep convolutional neural network (CNN). This is demonstrated\nthrough the design of a pedestrian detector with a pool of features whose\ncomplexities span orders of magnitude. The resulting cascade generalizes the\ncombination of a CNN with an object proposal mechanism: rather than a\npre-processing stage, CompACT cascades seamlessly integrate CNNs in their\nstages. This enables state of the art performance on the Caltech and KITTI\ndatasets, at fairly fast speeds.","url_abs":"http://arxiv.org/abs/1507.05348v1","url_pdf":"http://arxiv.org/pdf/1507.05348v1.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"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/pedestrian-detection-on-caltech","task":"Pedestrian Detection","dataset":"Caltech","model":"CompACT-Deep","rank_in_archive_order":26,"of":33,"metrics":{"Reasonable Miss Rate":"11.75"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1507.05348","atlas_url":"https://app.syntology.ai/?focus=1507.05348","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":"1507.05348"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1507.05348\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1507.05348"},"call":"get_concepts_for_paper(arxiv_id=\"1507.05348\")"}],"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":"b15b7881b42be281bd89fedf80e6acd667811551234f4624fe9061cf375ee6de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}