{"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/quantized-densely-connected-u-nets-for","title":"Quantized Densely Connected U-Nets for Efficient Landmark Localization","arxiv_id":"1808.02194","date":"2018-08-07","proceeding":"ECCV 2018 9","authors":["Zhiqiang Tang","Xi Peng","Shijie Geng","Lingfei Wu","Shaoting Zhang","Dimitris Metaxas"],"abstract":"In this paper, we propose quantized densely connected U-Nets for efficient\nvisual landmark localization. The idea is that features of the same semantic\nmeanings are globally reused across the stacked U-Nets. This dense connectivity\nlargely improves the information flow, yielding improved localization accuracy.\nHowever, a vanilla dense design would suffer from critical efficiency issue in\nboth training and testing. To solve this problem, we first propose order-K\ndense connectivity to trim off long-distance shortcuts; then, we use a\nmemory-efficient implementation to significantly boost the training efficiency\nand investigate an iterative refinement that may slice the model size in half.\nFinally, to reduce the memory consumption and high precision operations both in\ntraining and testing, we further quantize weights, inputs, and gradients of our\nlocalization network to low bit-width numbers. We validate our approach in two\ntasks: human pose estimation and face alignment. The results show that our\napproach achieves state-of-the-art localization accuracy, but using ~70% fewer\nparameters, ~98% less model size and saving ~75% training memory compared with\nother benchmark localizers. The code is available at\nhttps://github.com/zhiqiangdon/CU-Net.","url_abs":"http://arxiv.org/abs/1808.02194v2","url_pdf":"http://arxiv.org/pdf/1808.02194v2.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":"quantized-densely-connected-u-nets-for","repo_url":"https://github.com/zhiqiangdon/CU-Net","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"face-alignment","task_name":"Face Alignment"},{"task_slug":"pose-estimation","task_name":"Pose Estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/pose-estimation-on-mpii-human-pose","task":"Pose Estimation","dataset":"MPII Human Pose","model":"DU-Net","rank_in_archive_order":19,"of":46,"metrics":{"PCKh-0.5":"91.2"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.02194","atlas_url":"https://app.syntology.ai/?focus=1808.02194","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.02194"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.02194\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.02194"},"call":"get_concepts_for_paper(arxiv_id=\"1808.02194\")"}],"by_repo":[{"repo":"zhiqiangdon/CU-Net","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":"74a5b7b70fd5a8be5cb9a0ad834242a1d8e96f61c026873e2182778641188b37","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}