{"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/doubleu-net-a-deep-convolutional-neural","title":"DoubleU-Net: A Deep Convolutional Neural Network for Medical Image Segmentation","arxiv_id":"2006.04868","date":"2020-06-08","proceeding":null,"authors":["Debesh Jha","Michael A. Riegler","Dag Johansen","Pål Halvorsen","Håvard D. Johansen"],"abstract":"Semantic image segmentation is the process of labeling each pixel of an image with its corresponding class. An encoder-decoder based approach, like U-Net and its variants, is a popular strategy for solving medical image segmentation tasks. To improve the performance of U-Net on various segmentation tasks, we propose a novel architecture called DoubleU-Net, which is a combination of two U-Net architectures stacked on top of each other. The first U-Net uses a pre-trained VGG-19 as the encoder, which has already learned features from ImageNet and can be transferred to another task easily. To capture more semantic information efficiently, we added another U-Net at the bottom. We also adopt Atrous Spatial Pyramid Pooling (ASPP) to capture contextual information within the network. We have evaluated DoubleU-Net using four medical segmentation datasets, covering various imaging modalities such as colonoscopy, dermoscopy, and microscopy. Experiments on the MICCAI 2015 segmentation challenge, the CVC-ClinicDB, the 2018 Data Science Bowl challenge, and the Lesion boundary segmentation datasets demonstrate that the DoubleU-Net outperforms U-Net and the baseline models. Moreover, DoubleU-Net produces more accurate segmentation masks, especially in the case of the CVC-ClinicDB and MICCAI 2015 segmentation challenge datasets, which have challenging images such as smaller and flat polyps. These results show the improvement over the existing U-Net model. The encouraging results, produced on various medical image segmentation datasets, show that DoubleU-Net can be used as a strong baseline for both medical image segmentation and cross-dataset evaluation testing to measure the generalizability of Deep Learning (DL) models.","url_abs":"https://arxiv.org/abs/2006.04868v2","url_pdf":"https://arxiv.org/pdf/2006.04868v2.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":"doubleu-net-a-deep-convolutional-neural","repo_url":"https://github.com/DebeshJha/2020-CBMS-DoubleU-Net","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"doubleu-net-a-deep-convolutional-neural","repo_url":"https://github.com/Janetteeeeeeee/double_unet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"doubleu-net-a-deep-convolutional-neural","repo_url":"https://github.com/harsh-jadhav/SIIM-Pneumothorax-Case-Study2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"doubleu-net-a-deep-convolutional-neural","repo_url":"https://github.com/mehul-k5/Double-Unet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"cell-segmentation","task_name":"Cell Segmentation"},{"task_slug":"colorectal-polyps-characterization","task_name":"Colorectal Polyps Characterization"},{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"lesion-segmentation","task_name":"Lesion 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":"skin-cancer-segmentation","task_name":"Skin Cancer Segmentation"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[{"method_slug":"concatenated-skip-connection","method_name":"Concatenated Skip Connection"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"spatial-pyramid-pooling","method_name":"Spatial Pyramid Pooling"},{"method_slug":"u-net","method_name":"U-Net"},{"method_slug":"vgg-19","method_name":"VGG-19"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/lesion-segmentation-on-isic-2018","task":"Lesion Segmentation","dataset":"ISIC 2018","model":"DoubleU-Net","rank_in_archive_order":9,"of":17,"metrics":{"mean Dice":"0.8962"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-segmentation-on-2015-miccai","task":"Medical Image Segmentation","dataset":"2015 MICCAI Polyp Detection","model":"DoubleUNet","rank_in_archive_order":1,"of":1,"metrics":{"Dice":"0.7649"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-segmentation-on-2018-data","task":"Medical Image Segmentation","dataset":"2018 Data Science Bowl","model":"DoubleUNet","rank_in_archive_order":8,"of":10,"metrics":{"Dice":"0.9133","Precision":"0.9596","Recall":"0.6407","mIoU":"0.8407"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-segmentation-on-cvc-clinicdb","task":"Medical Image Segmentation","dataset":"CVC-ClinicDB","model":"DoubleUNet","rank_in_archive_order":34,"of":48,"metrics":{"mean Dice":"0.9239"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-segmentation-on-kvasir","task":"Medical Image Segmentation","dataset":"Kvasir-Instrument","model":"DoubleUNet","rank_in_archive_order":3,"of":3,"metrics":{"DSC":"0.9038"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-kvasir-instrument","task":"Semantic Segmentation","dataset":"Kvasir-Instrument","model":"DoubleUNet","rank_in_archive_order":1,"of":2,"metrics":{"DSC":"0.9038","mIoU":"0.8430"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2006.04868","atlas_url":"https://app.syntology.ai/?focus=2006.04868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04868"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.04868"},"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_harvested_code_for_paper","arguments":{"arxiv_id":"2006.04868"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.04868\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2006.04868"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2006.04868\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2006.04868"},"call":"get_concepts_for_paper(arxiv_id=\"2006.04868\")"}],"by_repo":[{"repo":"DebeshJha/2020-CBMS-DoubleU-Net","kind":"official","samples":1,"ran":1,"instrument":0,"unverified":0},{"repo":"Janetteeeeeeee/double_unet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"harsh-jadhav/SIIM-Pneumothorax-Case-Study2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1505.04597"],"harvested_for_calls":[{"arxiv_id":"1505.04597","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.04597"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.04597\")"}]},{"repo":"mehul-k5/Double-Unet","kind":"listed","samples":4,"ran":1,"instrument":0,"unverified":3}],"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","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/2006.04868.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/2006.04868.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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/DebeshJha/2020-CBMS-DoubleU-Net","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/harsh-jadhav/SIIM-Pneumothorax-Case-Study2","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mehul-k5/Double-Unet","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Janetteeeeeeee/double_unet","reach":{"status":"ok"}}],"summary":{"ran_violates":1,"ran_honours":1,"unverified":3},"n_samples":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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":1,"ran":1,"n_ran_checked":1,"n_instrument":0,"repositories":1},"listed":{"samples":4,"ran":1,"n_ran_checked":1,"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":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","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"},"samples":[{"code_sha256":"8c11a5b2be400501","code_sha256_prefix":"8c11a5b2be400501","entry":"mask_to_3d","repo":"DebeshJha/2020-CBMS-DoubleU-Net","repo_kind":"official","path":"predict.py","file_url":"https://github.com/DebeshJha/2020-CBMS-DoubleU-Net/blob/HEAD/predict.py","link_basis":"plan_row","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"mask:ndarray/2/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"8c11a5b2be400501"},"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, DebeshJha/2020-CBMS-DoubleU-Net when it was checked","mcp_get_code":{"code_sha256":"8c11a5b2be400501"}},{"code_sha256":"d17bdccd6a7148ae","code_sha256_prefix":"d17bdccd6a7148ae","entry":"shuffling","repo":"mehul-k5/Double-Unet","repo_kind":"listed","path":"evaluation_cvc.py","file_url":"https://github.com/mehul-k5/Double-Unet/blob/HEAD/evaluation_cvc.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"x:ndarray/2/int, y:ndarray/1/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"d17bdccd6a7148ae"},"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, mehul-k5/Double-Unet when it was checked","mcp_get_code":{"code_sha256":"d17bdccd6a7148ae"}},{"code_sha256":"412a0c7c8d72349a","code_sha256_prefix":"412a0c7c8d72349a","entry":"convolutionBlock","repo":"mehul-k5/Double-Unet","repo_kind":"listed","path":"model.py","file_url":"https://github.com/mehul-k5/Double-Unet/blob/HEAD/model.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, mehul-k5/Double-Unet when it was checked","mcp_get_code":{"code_sha256":"412a0c7c8d72349a"}},{"code_sha256":"9d37a8597bd5f77f","code_sha256_prefix":"9d37a8597bd5f77f","entry":"encoder1","repo":"mehul-k5/Double-Unet","repo_kind":"listed","path":"model.py","file_url":"https://github.com/mehul-k5/Double-Unet/blob/HEAD/model.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, mehul-k5/Double-Unet when it was checked","mcp_get_code":{"code_sha256":"9d37a8597bd5f77f"}},{"code_sha256":"1250d6ab27095932","code_sha256_prefix":"1250d6ab27095932","entry":"squeezeExciteBlock","repo":"mehul-k5/Double-Unet","repo_kind":"listed","path":"model.py","file_url":"https://github.com/mehul-k5/Double-Unet/blob/HEAD/model.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, mehul-k5/Double-Unet when it was checked","mcp_get_code":{"code_sha256":"1250d6ab27095932"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a5f331511bf07c9c646651dabc9e92f8e399539a626e223a7ee0d42a503d5bf8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}