{"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/on-the-compactness-efficiency-and","title":"On the Compactness, Efficiency, and Representation of 3D Convolutional Networks: Brain Parcellation as a Pretext Task","arxiv_id":"1707.01992","date":"2017-07-06","proceeding":null,"authors":["Wenqi Li","Guotai Wang","Lucas Fidon","Sebastien Ourselin","M. Jorge Cardoso","Tom Vercauteren"],"abstract":"Deep convolutional neural networks are powerful tools for learning visual\nrepresentations from images. However, designing efficient deep architectures to\nanalyse volumetric medical images remains challenging. This work investigates\nefficient and flexible elements of modern convolutional networks such as\ndilated convolution and residual connection. With these essential building\nblocks, we propose a high-resolution, compact convolutional network for\nvolumetric image segmentation. To illustrate its efficiency of learning 3D\nrepresentation from large-scale image data, the proposed network is validated\nwith the challenging task of parcellating 155 neuroanatomical structures from\nbrain MR images. Our experiments show that the proposed network architecture\ncompares favourably with state-of-the-art volumetric segmentation networks\nwhile being an order of magnitude more compact. We consider the brain\nparcellation task as a pretext task for volumetric image segmentation; our\ntrained network potentially provides a good starting point for transfer\nlearning. Additionally, we show the feasibility of voxel-level uncertainty\nestimation using a sampling approximation through dropout.","url_abs":"http://arxiv.org/abs/1707.01992v1","url_pdf":"http://arxiv.org/pdf/1707.01992v1.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":"on-the-compactness-efficiency-and","repo_url":"https://github.com/gift-surg/HighRes3DNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"on-the-compactness-efficiency-and","repo_url":"https://github.com/black0017/MedicalZooPytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"on-the-compactness-efficiency-and","repo_url":"https://github.com/fepegar/highresnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"on-the-compactness-efficiency-and","repo_url":"https://github.com/khanlab/hippunfold","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"3d-medical-imaging-segmentation","task_name":"3D Medical Imaging Segmentation"},{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"medical-image-segmentation","task_name":"Medical Image Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"},{"task_slug":"volumetric-medical-image-segmentation","task_name":"Volumetric Medical Image Segmentation"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1707.01992","atlas_url":"https://app.syntology.ai/?focus=1707.01992","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":"1707.01992"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1707.01992\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1707.01992"},"call":"get_concepts_for_paper(arxiv_id=\"1707.01992\")"}],"by_repo":[{"repo":"gift-surg/HighRes3DNet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"black0017/MedicalZooPytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1606.04797","1804.02967"],"harvested_for_calls":[{"arxiv_id":"1606.04797","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1606.04797"},"call":"get_harvested_code_for_paper(arxiv_id=\"1606.04797\")"},{"arxiv_id":"1804.02967","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1804.02967"},"call":"get_harvested_code_for_paper(arxiv_id=\"1804.02967\")"}]},{"repo":"fepegar/highresnet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"khanlab/hippunfold","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"fe9df99f88558814a69fb7fa753284491a818f103779d505faa232e443201bb6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}