Evidence map›Paper›PMID 40307461›Full record

ArticleScientific reports2025

A brain tumor segmentation method based on attention mechanism.

Juan Cao, Jinjia Liu, Jiaran Chen

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Juan CaoSchool of Information Science and Engineering, Chongqing Jiaotong University, Chongqing, 400074, China.
Jinjia Liu *School of Information Science and Engineering, Chongqing Jiaotong University, Chongqing, 400074, China. 622220070052@mails.cqjtu.edu.cn.
Jiaran Chen *School of Information Science and Engineering, Chongqing Jiaotong University, Chongqing, 400074, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The rise in brain tumor incidence due to the global population aging has intensified the need for precise segmentation methods in clinical settings. Current segmentation networks often fail to capture comprehensive contextual information and fine edge details of brain tumors, which are crucial for accurate diagnosis and treatment. To address these challenges, we introduce BSAU-Net, a novel segmentation algorithm that employs attention mechanisms and edge feature extraction modules to enhance performance. Our approach aims to assist clinicians in making more accurate diagnostic and therapeutic decisions. BSAU-Net incorporates an edge feature extraction module (EA) based on the Sobel operator, enhancing the model's sensitivity to tumor regions while preserving edge contours. Additionally, a spatial attention module (SPA) is introduced to establish global feature correlations, critical for accurate tumor segmentation. To address class imbalance, which can hinder performance, we propose BADLoss, a loss function tailored to mitigate this issue. Experimental results on the BraTS2018 and BraTS2021 datasets demonstrate the effectiveness of BSAU-Net, achieving average Dice coefficients of 0.7506 and 0.7556, PPV of 0.7863 and 0.7843, sensitivity of 0.8998 and 0.9017, and HD95 of 2.1701 and 2.1543, respectively. These results highlight BSAU-Net's potential to significantly improve brain tumor segmentation in clinical practice.

Indexed as

Brain NeoplasmsImage Processing, Computer-AssistedAlgorithmsHumansMagnetic Resonance ImagingNeural Networks, ComputerAttention mechanismBrain tumor segmentationEdge refinement

Identifiers

PMID40307461
PMCPMC12043955

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.