{"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/e2enet-dynamic-sparse-feature-fusion-for","title":"E2ENet: Dynamic Sparse Feature Fusion for Accurate and Efficient 3D Medical Image Segmentation","arxiv_id":"2312.04727","date":"2023-12-07","proceeding":null,"authors":["Boqian Wu","Qiao Xiao","Shiwei Liu","Lu Yin","Mykola Pechenizkiy","Decebal Constantin Mocanu","Maurice van Keulen","Elena Mocanu"],"abstract":"Deep neural networks have evolved as the leading approach in 3D medical image segmentation due to their outstanding performance. However, the ever-increasing model size and computation cost of deep neural networks have become the primary barrier to deploying them on real-world resource-limited hardware. In pursuit of improving performance and efficiency, we propose a 3D medical image segmentation model, named Efficient to Efficient Network (E2ENet), incorporating two parametrically and computationally efficient designs. i. Dynamic sparse feature fusion (DSFF) mechanism: it adaptively learns to fuse informative multi-scale features while reducing redundancy. ii. Restricted depth-shift in 3D convolution: it leverages the 3D spatial information while keeping the model and computational complexity as 2D-based methods. We conduct extensive experiments on BTCV, AMOS-CT and Brain Tumor Segmentation Challenge, demonstrating that E2ENet consistently achieves a superior trade-off between accuracy and efficiency than prior arts across various resource constraints. E2ENet achieves comparable accuracy on the large-scale challenge AMOS-CT, while saving over 68\\% parameter count and 29\\% FLOPs in the inference phase, compared with the previous best-performing method. Our code has been made available at: https://github.com/boqian333/E2ENet-Medical.","url_abs":"https://arxiv.org/abs/2312.04727v1","url_pdf":"https://arxiv.org/pdf/2312.04727v1.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":"e2enet-dynamic-sparse-feature-fusion-for","repo_url":"https://github.com/boqian333/e2enet-medical","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"brain-tumor-segmentation","task_name":"Brain Tumor 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":"tumor-segmentation","task_name":"Tumor Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2312.04727","atlas_url":"https://app.syntology.ai/?focus=2312.04727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04727"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2312.04727"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_reference_implementation","arguments":{"name":"E2ENet"},"call":"get_reference_implementation(name='E2ENet')","min_level":{"quoted_from_server_card":["It REFUSES rather than serving below min_level, and the refusal names the highest level that exists","so lowering min_level is a deliberate, informed choice, not a guess."],"default_on_card":2,"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","this_implementation_level":2}},{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2312.04727"},"call":"get_harvested_code_for_paper(arxiv_id=\"2312.04727\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2312.04727"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2312.04727\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2312.04727"},"call":"get_concepts_for_paper(arxiv_id=\"2312.04727\")"}],"reference_implementation":[{"method_name":"E2ENet","assembly_sha256":"c0bcb12154becd68","source":"generated from the paper text (not the authors' code)","level":2,"level_is_quoted_from_server_card":[{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]}],"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","no_rung":"No rung compares this code against the authors' implementation","no_rung_quoted_from_server_card":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.","retrieve_with":"get_reference_implementation(name='E2ENet')","have_check":{"url":"https://syntology.ai/api/graph/have?x=2312.04727","call":"have('2312.04727')","in_build_sample":false}}],"reference_implementation_is":"Syntology's reference implementation of this paper's method: code Syntology generated from the paper text (not the authors' code), at the level its own end-to-end run recorded (the assembly's own level, never averaged); the level's meaning is quoted from Syntology's server card, and nothing here says the code is correct or reproduces the paper's results","by_repo":[{"repo":"boqian333/e2enet-medical","kind":"official","samples":5,"ran":4,"instrument":0,"unverified":1}],"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","assemblies":[{"assembly_sha256":"c0bcb12154becd68","source_kind":"generated","method_name":"E2ENet","realizes_method":"E2ENet","graph_method":"E2ENet","realizes_severed":false,"claim":"Compute importance scores for feature connections based on L1 norm of convolution kernel weights. Input kernel_weights is a 2D array of shape (C_out, C_in) representing the weights of a 1x1 convolution kernel (or flattened spatial dimensions). For each of the C_out * C_in feature connections, comput","centrality":"contribution","entry":"compute_importance_scores","entry_sha256":"78ff4f81e9381e251dfc7b7e2631ff859f813d70ca461791aee5998500f5413a","n_bricks":1,"bricks":[{"entry":"compute_importance_scores","code_sha256":"78ff4f81e9381e251dfc7b7e2631ff859f813d70ca461791aee5998500f5413a","role":"entry","order":0,"level":2,"status":"ran_draft_wrong"}],"ran_individually":1,"ran_individually_constructed":null,"ran_individually_by_status":{"ran_draft_wrong":1},"end_to_end":{"ran":true,"level":2,"against_independent_peer":true,"n_peers":1,"v3_tests_passed_both_sides":0,"means":"this assembly is a single routine, so the entry brick's verification IS the assembly's: it executed and two family-independent implementations agreed"},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"construction","claim_match_judges":["construction:spec_drafted_for_this_method"],"label_verdict":"matches","label_verdict_judged":false,"suggested_method":null,"batch_at":"2026-09-07T20:44:12+00:00","sibling_group":"8ed23c912ca7","n_siblings":0,"retention":"keep","provenance":"assembly:generated_reference_impl_v1","attached_at":"2026-09-07T20:44:12+00:00","attached_provenance":"assembly:generated_reference_impl_v1"}],"assembly_sibling_groups":[{"group":"8ed23c912ca7","realizes_method":"E2ENet","source_kind":"generated","batch_at":"2026-09-07T20:44:12+00:00","members":["c0bcb12154becd68"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2312.04727"},"call":"assembly(arxiv_id=\"2312.04727\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2312.04727.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2312.04727.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/boqian333/E2ENet-Medical","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/boqian333/e2enet-medical","reach":{"status":"ok"}}],"summary":{"ran_violates":3,"ran_honours":1,"unverified":1},"n_samples":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":5,"ran":4,"n_ran_checked":4,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":5,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"c6cd5ad91c3a2851","code_sha256_prefix":"c6cd5ad91c3a2851","entry":"convert_CT_seg","repo":"boqian333/e2enet-medical","repo_kind":"official","path":"e2enet/dataset_conversion/Task037_038_Chaos_Challenge.py","file_url":"https://github.com/boqian333/e2enet-medical/blob/HEAD/e2enet/dataset_conversion/Task037_038_Chaos_Challenge.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"loaded_png:ndarray/3/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"c6cd5ad91c3a2851"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, boqian333/e2enet-medical when it was checked","mcp_get_code":{"code_sha256":"c6cd5ad91c3a2851"}},{"code_sha256":"74dcea3d4dcc90a5","code_sha256_prefix":"74dcea3d4dcc90a5","entry":"convert_MR_seg","repo":"boqian333/e2enet-medical","repo_kind":"official","path":"e2enet/dataset_conversion/Task037_038_Chaos_Challenge.py","file_url":"https://github.com/boqian333/e2enet-medical/blob/HEAD/e2enet/dataset_conversion/Task037_038_Chaos_Challenge.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"loaded_png:ndarray/2/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"74dcea3d4dcc90a5"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, boqian333/e2enet-medical when it was checked","mcp_get_code":{"code_sha256":"74dcea3d4dcc90a5"}},{"code_sha256":"a2c8b38ba9393780","code_sha256_prefix":"a2c8b38ba9393780","entry":"convert_labels_back_to_BraTS","repo":"boqian333/e2enet-medical","repo_kind":"official","path":"e2enet/dataset_conversion/Task032_BraTS_2018.py","file_url":"https://github.com/boqian333/e2enet-medical/blob/HEAD/e2enet/dataset_conversion/Task032_BraTS_2018.py","link_basis":"harvester_set","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"seg:ndarray/3/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T00:28:05.031210+00:00","retrieve_with":{"tool":"get_code","code_sha256":"a2c8b38ba9393780"},"code_page":"/code/convert-labels-back-to-brats","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, boqian333/e2enet-medical when it was checked","mcp_get_code":{"code_sha256":"a2c8b38ba9393780"}},{"code_sha256":"35c1fd676bd5d2b0","code_sha256_prefix":"35c1fd676bd5d2b0","entry":"str2bool","repo":"boqian333/E2ENet-Medical","repo_kind":"official","path":"simple_main.py","file_url":"https://github.com/boqian333/E2ENet-Medical/blob/HEAD/simple_main.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"str:str/0/str","fixture_out_type":"bool","code_page":"/code/str2bool","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, boqian333/E2ENet-Medical when it was checked","mcp_get_code":{"code_sha256":"35c1fd676bd5d2b0"}},{"code_sha256":"29176ca87f23c2d7","code_sha256_prefix":"29176ca87f23c2d7","entry":"load_png_stack","repo":"boqian333/e2enet-medical","repo_kind":"official","path":"e2enet/dataset_conversion/Task037_038_Chaos_Challenge.py","file_url":"https://github.com/boqian333/e2enet-medical/blob/HEAD/e2enet/dataset_conversion/Task037_038_Chaos_Challenge.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, boqian333/e2enet-medical when it was checked","mcp_get_code":{"code_sha256":"29176ca87f23c2d7"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1887dce675ee127079fd2431071852a80c5bac89fd2177e3560d2d610eefbdaa","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}