paper-with-me

홈 › Papers

DCSAU-Net: A Deeper and More Compact Split-Attention U-Net for Medical Image Segmentation

2022-02-02 · Qing Xu, Zhicheng Ma, Na He, Wenting Duan

Deep learning architecture with convolutional neural network (CNN) achieves outstanding success in the field of computer vision. Where U-Net, an encoder-decoder architecture structured by CNN, makes a great breakthrough in biomedical image segmentation and has been applied in a wide range of practical scenarios. However, the equal design of every downsampling layer in the encoder part and simply stacked convolutions do not allow U-Net to extract sufficient information of features from different depths. The increasing complexity of medical images brings new challenges to the existing methods. In this paper, we propose a deeper and more compact split-attention u-shape network (DCSAU-Net), which efficiently utilises low-level and high-level semantic information based on two novel frameworks: primary feature conservation and compact split-attention block. We evaluate the proposed model on CVC-ClinicDB, 2018 Data Science Bowl, ISIC-2018 and SegPC-2021 datasets. As a result, DCSAU-Net displays better performance than other state-of-the-art (SOTA) methods in terms of the mean Intersection over Union (mIoU) and F1-socre. More significantly, the proposed model demonstrates excellent segmentation performance on challenging images. The code for our work and more technical details can be found at https://github.com/xq141839/DCSAU-Net.

📄 PDF Abstract BibTeX arXiv:2202.00972

Code (1)

xq141839/DCSAU-Net 공식 구현 pytorch

Tasks

DecoderImage SegmentationLesion SegmentationMedical Image SegmentationSemantic Segmentation

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Concatenated Skip Connection A Concatenated Skip Connection is a type of skip connection that seeks to reuse features by concatenating them to new layers, allowing more information to be retained from…
U-Net 설명 없음

Similar Papers 제목 키워드 기반

A Multi-Head Attention Soft Random Forest for Interpretable Patient No-Show Prediction

2025-05-22 · Ninda Nurseha Amalina, Kwadwo Boateng Ofori-Amanfo, Heungjo An

Unattended scheduled appointments, defined as patient no-shows, adversely affect both healthcare providers and patients' health, disrupting the continuity of care, operational efficiency, and the efficient allocation of …

Feature Importance

Optimizing Split Points for Error-Resilient SplitFed Learning

2024-05-29 · Chamani Shiranthika, Parvaneh Saeedi, Ivan V. Bajić

Recent advancements in decentralized learning, such as Federated Learning (FL), Split Learning (SL), and Split Federated Learning (SplitFed), have expanded the potentials of machine learning. SplitFed aims to minimize th…

Federated LearningImage SegmentationSemantic Segmentation

One Explanation is Not Enough: Structured Attention Graphs for Image Classification

2020-11-13 · NeurIPS 2021 12 · Vivswan Shitole, Li Fuxin, Minsuk Kahng, Prasad Tadepalli 외

Attention maps are a popular way of explaining the decisions of convolutional networks for image classification. Typically, for each image of interest, a single attention map is produced, which assigns weights to pixels …

ClassificationcounterfactualGeneral Classificationimage-classification+1

SplitFed resilience to packet loss: Where to split, that is the question

2023-07-25 · Chamani Shiranthika, Zahra Hafezi Kafshgari, Parvaneh Saeedi, Ivan V. Bajić

Decentralized machine learning has broadened its scope recently with the invention of Federated Learning (FL), Split Learning (SL), and their hybrids like Split Federated Learning (SplitFed or SFL). The goal of SFL is to…

Federated Learning

Product Split Trees

2017-07-01 · CVPR 2017 7 · Artem Babenko, Victor Lempitsky

In this work, we introduce a new kind of spatial partition trees for efficient nearest-neighbor search. Our approach first identifies a set of useful data splitting directions, and then learns a codebook that can be used…

ClusteringQuantization