Evidence map›Paper›PMID 35634040›Full record

ArticleComputational intelligence and neuroscience2022

A Novel U-Net Based Deep Learning Method for 3D Cardiovascular MRI Segmentation.

Yinan Lu, Yan Zhao, Xing Chen, Xiaoxin Guo

Abstract read
In one paragraph

Article in Computational intelligence and neuroscience, 2022. 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. On the Analyses of Medical Images Using Traditional Machine Learning Techniques and Convolutional Neural Networks.Archives of computational methods in engineering : state of the art reviews · 2023
    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

4 authors.

Yinan LuCollege of Computer Science and Technology, Jilin University, Changchun 130000, China.ORCID https://orcid.org/0000-0001-5786-9178
Yan ZhaoCollege of Computer Science and Technology, Jilin University, Changchun 130000, China.ORCID https://orcid.org/0000-0003-3465-3758
Xing ChenCollege of Artificial Intelligence, Jilin University, Changchun 130000, China.ORCID https://orcid.org/0000-0001-5685-8506
Xiaoxin GuoCollege of Computer Science and Technology, Jilin University, Changchun 130000, China.ORCID https://orcid.org/0000-0001-7889-6263

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Medical multiobjective image segmentation aims to group pixels to form multiple regions based on the different properties of the medical images. Segmenting the 3D cardiovascular magnetic resonance (CMR) images is still a challenging task owing to several reasons, including individual differences in heart shapes, varying signal intensities, and differences in data signal-to-noise ratios. This paper proposes a novel and efficient U-Net-based 3D sparse convolutional network named SparseVoxNet. In this network, there are direct connections between any two layers with the same feature-map size, and the number of connections is reduced. Therefore, the SparseVoxNet can effectively cope with the optimization problem of gradients vanishing when training a 3D deep neural network model on small sample data by significantly decreasing the network depth, and achieveing better feature representation using a spatial self-attention mechanism finally. The proposed method in this paper has been thoroughly evaluated on the HVSMR 2016 dataset. Compared with other methods, the method achieves better performance.

Indexed as

Deep LearningHeartMagnetic Resonance ImagingNeural Networks, Computer

Identifiers

PMID35634040
PMCPMC9142300

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.