Search arXivSearch

arXiv · 2402.08276

Rethinking U-net Skip Connections for Biomedical Image Segmentation

Abstract

The U-net architecture has significantly impacted deep learning-based segmentation of medical images. Through the integration of long-range skip connections, it facilitated the preservation of high-resolution features. Out-of-distribution data can, however, substantially impede the performance of neural networks. Previous works showed that the trained network layers differ in their susceptibility to this domain shift, e.g., shallow layers are more affected than deeper layers. In this work, we investigate the implications of this observation of layer sensitivity to domain shifts of U-net-style segmentation networks. By copying features of shallow layers to corresponding decoder blocks, these bear the risk of re-introducing domain-specific information. We used a synthetic dataset to model different levels of data distribution shifts and evaluated the impact on downstream segmentation performance. We quantified the inherent domain susceptibility of each network layer, using the Hellinger distance. These experiments confirmed the higher domain susceptibility of earlier network layers. When gradually removing skip connections, a decrease in domain susceptibility of deeper layers could be observed. For downstream segmentation performance, the original U-net outperformed the variant without any skip connections. The best performance, however, was achieved when removing the uppermost skip connection - not only in the presence of domain shifts but also for in-domain test data. We validated our results on three clinical datasets - two histopathology datasets and one magnetic resonance dataset - with performance increases of up to 10% in-domain and 13% cross-domain when removing the uppermost skip connection.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frauke Wilm, Jonas Ammeling, Mathias Öttl, Rutger H. J. Fick, Marc Aubreville, Katharina Breininger. 2024-02-13. Rethinking U-net Skip Connections for Biomedical Image Segmentation. https://arxiv.org/abs/2402.08276

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

IViT: A Novel Interpretable Visual Transformer for Skin Disease Detection

The clinical diagnosis of skin diseases is susceptible to interference from inter-class similarity of skin lesions, and over-reliance on clinicians'experience easily leads to subjective bias. Although existing deep learning aided diagnosis methods achieve competitive accuracy, they suffer from the black-box opacity of Vision Transformer (ViT) and poor adaptability to medical few-shot scenarios. Moreover, mainstream explainable algorithms generally face the bottleneck of significant accuracy degradation when improving interpretability. This paper proposes an interpretable ViT (IViT) constrained by Quadratic Programming (QP). The introduced pre-trained transfer learning adapts to few-shot feature extraction. A discrete QP feature selection framework is constructed to screen generic and discriminative features consistent with clinical diagnostic logic. A multi-objective loss function is designed to reduce feature redundancy and optimize activation distribution while preserving classification performance. Experimental results on six standard skin disease datasets show that IViT achieves an accuracy of 93.80%, only 0.21% lower than the baseline, with feature redundancy reduced by 29.5%. Its core activation regions are consistent with clinically concerned lesion areas. The proposed model balances accuracy and interpretability, providing a reliable solution for the clinical deployment of few-shot intelligent skin disease diagnosis.

eess.IV

Automated Distinction of Intimal and Medial Intracranial Arterial Calcification from CT Head

Intracranial arterial calcifications (IACs) are a common finding on clinical non-contrast enhanced head CT scans and are associated with neurovascular disease. Calcifications can occur in the intimal or medial layer of the arterial wall, subtypes that differ in aetiology and may have distinct clinical relevance. These subtypes can be visually distinguished by radiologists based on the shape of the calcifications. We investigate three automated approaches for subtype classification of IAC from head CT-derived segmentation masks: (1) an automated adaptation of the established radiological visual score, (2) a sphericity-based method, and (3) a method based on shape embeddings extracted by a medical shape foundation model. All approaches use the same lightweight classification pipeline on top of the features they compute and are evaluated using 5-fold cross-validation. The three methods achieved comparable performance, with the embedding-based approach yielding the best overall results with a weighted F1 (mean $\pm$ SD) of up to 71.5 $\pm$ 3.7 for a single artery and 59.8 $\pm$ 1.7 for the joint artery classification. Performance was largely preserved when using automated instead of manual IAC segmentation masks, and we found the difference in weighted F1 not significant. Our results show that fully automated IAC subtype quantification from head CT is feasible and remains robust to the use of manual and automated IAC segmentation masks. Code at https://github.com/bjin96/iac-subtyping.

eess.IV

Recasting the Destroy Step of Large Neighborhood Search as Dense Segmentation

Large neighborhood search improves an incumbent by releasing selected variables and repairing the resulting subproblem under a time limit. FOVEA casts variable selection as dense semantic segmentation on a fixed $128\times128$ canvas. A small U-Net reads twelve semantic channels and predicts cell scores, which are decoded into a variable set subject to a fixed variable budget. Family-specific layouts connect the search state to the canvas, while one set of network weights serves four problem families. The FP32 network input occupies $786$\,kB across instance sizes. Our analysis bounds constraint coupling for spatially coherent regions, gives a rank certificate for rounds with zero possible improvement, and bounds the coupling advantage attainable on an expander family. On the tested families and hardware, FOVEA trails the strongest graph encoder at $10^{4}$ variables and overtakes it near $1.5\times10^{4}$; the cost model provides an approximate crossover estimate. At larger sizes, where the graph-encoder baselines exceed device memory, FOVEA reduces the primal integral by $12$ to $16\%$ relative to the best runnable baselines. On the expander family, FOVEA performs comparably to random selection, with a coupling advantage close to one.

eess.IV