{"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/hierarchical-binary-cnns-for-landmark","title":"Hierarchical binary CNNs for landmark localization with limited resources","arxiv_id":"1808.04803","date":"2018-08-14","proceeding":null,"authors":["Adrian Bulat","Georgios Tzimiropoulos"],"abstract":"Our goal is to design architectures that retain the groundbreaking\nperformance of Convolutional Neural Networks (CNNs) for landmark localization\nand at the same time are lightweight, compact and suitable for applications\nwith limited computational resources. To this end, we make the following\ncontributions: (a) we are the first to study the effect of neural network\nbinarization on localization tasks, namely human pose estimation and face\nalignment. We exhaustively evaluate various design choices, identify\nperformance bottlenecks, and more importantly propose multiple orthogonal ways\nto boost performance. (b) Based on our analysis, we propose a novel\nhierarchical, parallel and multi-scale residual architecture that yields large\nperformance improvement over the standard bottleneck block while having the\nsame number of parameters, thus bridging the gap between the original network\nand its binarized counterpart. (c) We perform a large number of ablation\nstudies that shed light on the properties and the performance of the proposed\nblock. (d) We present results for experiments on the most challenging datasets\nfor human pose estimation and face alignment, reporting in many cases\nstate-of-the-art performance. (e) We further provide additional results for the\nproblem of facial part segmentation. Code can be downloaded from\nhttps://www.adrianbulat.com/binary-cnn-landmark","url_abs":"http://arxiv.org/abs/1808.04803v1","url_pdf":"http://arxiv.org/pdf/1808.04803v1.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":"hierarchical-binary-cnns-for-landmark","repo_url":"https://github.com/1adrianb/binary-networks-pytorch","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"3d-face-alignment","task_name":"3D Face Alignment"},{"task_slug":"binarization","task_name":"Binarization"},{"task_slug":"face-alignment","task_name":"Face Alignment"},{"task_slug":"pose-estimation","task_name":"Pose Estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/3d-face-alignment-on-aflw2000-3d","task":"3D Face Alignment","dataset":"AFLW2000-3D","model":"Ours","rank_in_archive_order":1,"of":1,"metrics":{"NME":"3.26"},"uses_additional_data":false},{"leaderboard":"/sota/face-alignment-on-aflw-lfpa","task":"Face Alignment","dataset":"AFLW-LFPA","model":"Ours","rank_in_archive_order":3,"of":3,"metrics":{"NME":"3.02"},"uses_additional_data":false},{"leaderboard":"/sota/pose-estimation-on-mpii-human-pose","task":"Pose Estimation","dataset":"MPII Human Pose","model":"x","rank_in_archive_order":43,"of":46,"metrics":{"PCKh-0.5":"81.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.04803","atlas_url":"https://app.syntology.ai/?focus=1808.04803","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":"1808.04803"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.04803\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.04803"},"call":"get_concepts_for_paper(arxiv_id=\"1808.04803\")"}],"by_repo":[{"repo":"1adrianb/binary-networks-pytorch","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1603.05279"],"harvested_for_calls":[{"arxiv_id":"1603.05279","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1603.05279"},"call":"get_harvested_code_for_paper(arxiv_id=\"1603.05279\")"}]}],"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":"0494e8e3651c42d6364949093b40fc13f25a57b0e67e1a9b1c017b489267e00b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}