Evidence map›Paper›PMID 39926448›Full record

ArticleSurgical neurology international2025

Artificial intelligence in corticospinal tract segmentation using constrained spherical deconvolution.

Erom Lucas Alves Freitas, Bruno Fernandes de Oliveira Santos

Abstract read
In one paragraph

Article in Surgical neurology international, 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

2 authors.

Erom Lucas Alves FreitasDepartment of Medicine, Federal University of Sergipe, Aracaju, Brazil.
Bruno Fernandes de Oliveira SantosDepartment of Medicine, Federal University of Sergipe, Aracaju, Brazil.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Background: Tractography of cerebral white matter tracts is a technique with applications in neurosurgical planning and the diagnosis of neurological diseases. In this context, the approach based on the constrained spherical deconvolution (CSD) algorithm allows for more efficient and plausible segmentations. This study aimed to compare two CSD techniques for corticospinal tract (CST) segmentation. Methods: This study examined 40 diffusion-weighted images (DWIs) acquired at 7T from healthy participants in the human connectome project (HCP) and 12 clinical 1.5T DWIs from patients undergoing neurosurgical procedures. Tractography was performed using two techniques: regions of interest-based approach and an automatic approach using the TractSeg neural network. The volume of the CST segmented by the two methods was compared using the Dice similarity coefficient. Results: There was a low similarity between the CST volumes segmented by the two techniques (Dice index for the HCP: 0.479 ± 0.04; Dice index for the Clinical: 0.404 ± 0.08). However, both techniques achieved high levels of consistency in sequential measurements, with intraclass correlation coefficient values above 0.995 for all comparisons. In addition, all selected metrics showed significant differences when comparing the two techniques (HCP - volume Conclusion: Both methods demonstrate a high degree of consistency; however, the automatic approach appears to be more consistent overall. When comparing the CST segmentations between the two methods, we observed only a moderate similarity and differences in all considered metrics.

Indexed as

Constrained spherical deconvolutionCorticospinal tractTractography probabilisticTractSeg

Identifiers

PMID39926448
PMCPMC11799708

What OpenQuestion holds

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