Papers › UNet++: Redesigning Skip Connections to Exploit Multiscale Features in Image Segmentation

UNet++: Redesigning Skip Connections to Exploit Multiscale Features in Image Segmentation

11 Dec 2019arXiv:1912.05074archive 2025-07-28

Zongwei Zhou, Md Mahfuzur Rahman Siddiquee, Nima Tajbakhsh, Jianming Liang

The state-of-the-art models for medical image segmentation are variants of U-Net and fully convolutional networks (FCN). Despite their success, these models have two limitations: (1) their optimal depth is apriori unknown, requiring extensive architecture search or inefficient ensemble of models of varying depths; and (2) their skip connections impose an unnecessarily restrictive fusion scheme, forcing aggregation only at the same-scale feature maps of the encoder and decoder sub-networks. To overcome these two limitations, we propose UNet++, a new neural architecture for semantic and instance segmentation, by (1) alleviating the unknown network depth with an efficient ensemble of U-Nets of varying depths, which partially share an encoder and co-learn simultaneously using deep supervision; (2) redesigning skip connections to aggregate features of varying semantic scales at the decoder sub-networks, leading to a highly flexible feature fusion scheme; and (3) devising a pruning scheme to accelerate the inference speed of UNet++. We have evaluated UNet++ using six different medical image segmentation datasets, covering multiple imaging modalities such as computed tomography (CT), magnetic resonance imaging (MRI), and electron microscopy (EM), and demonstrating that (1) UNet++ consistently outperforms the baseline models for the task of semantic segmentation across different datasets and backbone architectures; (2) UNet++ enhances segmentation quality of varying-size objects -- an improvement over the fixed-depth U-Net; (3) Mask RCNN++ (Mask R-CNN with UNet++ design) outperforms the original Mask R-CNN for the task of instance segmentation; and (4) pruned UNet++ models achieve significant speedup while showing only modest performance degradation. Our implementation and pre-trained models are available at https://github.com/MrGiovanni/UNetPlusPlus.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1912.05074")

Code

Syntology Ran 1 of 9 code samples harvested from 1 repository linked to this paper; 8 have no recorded run. Of those that ran: 1 ran · our draft was wrong.

By repository: community (archive-listed): 7 samples from 1 repository, 1 ran; 2 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

13 repositories listed; official and paper-mentioned ones first.

MrGiovanni/UNetPlusPlus officialmentioned in papermentioned on GitHubpytorchNOASSERTION report
2023-MindSpore-1/ms-code-118 mentioned on GitHubmindspore report
MrGiovanni/Nested-UNet mentioned on GitHubpytorchNOASSERTION report
alexssanchez/unet-app-pucp mentioned on GitHub report
manuelhz/dissertation mentioned on GitHubpytorchMIT report
mrgiovanni/dissertation mentioned on GitHubMIT report
reyvaz/pneumothorax_detection mentioned on GitHubtf report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 1 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
8unverified

Licence: 2 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from manuelhz/dissertation. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

double_conv manuelhz/dissertation/BraTS/BraTS_unet_training.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 3e9ea4498e4b8a8d · report
double_conv2 manuelhz/dissertation/BraTS/BraTS_unet_++_pruned.py community (archive-listed) unverified MIT (permissive) · d4f3d905e75200e3 · report
double_conv2 manuelhz/dissertation/BraTS/BraTS_unet_++_training.py community (archive-listed) unverified MIT (permissive) · be52c1e7e30a5f3b · report
up3 manuelhz/dissertation/BraTS/BraTS_unet_++_pruned.py community (archive-listed) unverified MIT (permissive) · 7a968c1589ba71bb · report
up3 manuelhz/dissertation/BraTS/BraTS_unet_++_training.py community (archive-listed) unverified MIT (permissive) · a6667f374238aad5 · report
up4 manuelhz/dissertation/BraTS/BraTS_unet_++_pruned.py community (archive-listed) unverified MIT (permissive) · 7488d0ba5adf5cd7 · report
up4 manuelhz/dissertation/BraTS/BraTS_unet_++_training.py community (archive-listed) unverified MIT (permissive) · 22a234a1173d001e · report
unetp identical code first harvested elsewhere unverified licence of this copy not recorded · 6b0f999f9e74b1c8 · report
unetpp identical code first harvested elsewhere unverified licence of this copy not recorded · 42e3369990bb3769 · report

Tasks

Computed Tomography (CT)DecoderImage SegmentationInstance SegmentationMedical Image SegmentationSegmentationSemantic Segmentation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Brain Image Segmentation Brain Tumor UNet++ IoU 91.21 #1 of 1 Archive leaderboard report
Medical Image Segmentation Cell UNet++ IoU 91.21 #1 of 1 Archive leaderboard report
Medical Image Segmentation EM UNet++ IoU 89.33 #3 of 3 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Concatenated Skip ConnectionConvolutionMask R-CNNMax PoolingPruningRPNReLURoIAlignSPEEDSoftmaxU-NetUNet++

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections