{"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/feature-pyramid-and-hierarchical-boosting","title":"Feature Pyramid and Hierarchical Boosting Network for Pavement Crack Detection","arxiv_id":"1901.06340","date":"2019-01-18","proceeding":null,"authors":["Fan Yang","Lei Zhang","Sijia Yu","Danil Prokhorov","Xue Mei","Haibin Ling"],"abstract":"Pavement crack detection is a critical task for insuring road safety. Manual\ncrack detection is extremely time-consuming. Therefore, an automatic road crack\ndetection method is required to boost this progress. However, it remains a\nchallenging task due to the intensity inhomogeneity of cracks and complexity of\nthe background, e.g., the low contrast with surrounding pavements and possible\nshadows with similar intensity. Inspired by recent advances of deep learning in\ncomputer vision, we propose a novel network architecture, named Feature Pyramid\nand Hierarchical Boosting Network (FPHBN), for pavement crack detection. The\nproposed network integrates semantic information to low-level features for\ncrack detection in a feature pyramid way. And, it balances the contribution of\nboth easy and hard samples to loss by nested sample reweighting in a\nhierarchical way. To demonstrate the superiority and generality of the proposed\nmethod, we evaluate the proposed method on five crack datasets and compare it\nwith state-of-the-art crack detection, edge detection, semantic segmentation\nmethods. Extensive experiments show that the proposed method outperforms these\nstate-of-the-art methods in terms of accuracy and generality.","url_abs":"http://arxiv.org/abs/1901.06340v2","url_pdf":"http://arxiv.org/pdf/1901.06340v2.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":"feature-pyramid-and-hierarchical-boosting","repo_url":"https://github.com/fyangneil/pavement-crack-detection","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"edge-detection","task_name":"Edge Detection"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[{"slug":"crack500","name":"CRACK500","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.06340","atlas_url":"https://app.syntology.ai/?focus=1901.06340","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":"1901.06340"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.06340\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.06340"},"call":"get_concepts_for_paper(arxiv_id=\"1901.06340\")"}],"by_repo":[{"repo":"fyangneil/pavement-crack-detection","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"5f211291badf697e2cdfe460c48ee1de8227aacbc1fbbcc55026fe368e576f78","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}