Evidence map›Paper›PMID 37943809›Full record

ArticlePloS one2023

Population-wise labeling of sulcal graphs using multi-graph matching.

Rohit Yadav, François-Xavier Dupé, Sylvain Takerkart, Guillaume Auzias

Abstract read
In one paragraph

Article in PloS one, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing 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

2 citing papers in PubMed.

  1. Article
  2. 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.

Rohit YadavInstitut de Neurosciences de la Timone UMR 7289, CNRS, Aix-Marseille Université, Marseille, France.ORCID 0000-0002-9047-0764
François-Xavier DupéLaboratoire d'Informatique et Systèmes UMR 7020, CNRS, Aix-Marseille Université, Marseille, France.
Sylvain TakerkartInstitut de Neurosciences de la Timone UMR 7289, CNRS, Aix-Marseille Université, Marseille, France.ORCID 0000-0001-8410-0962
Guillaume AuziasInstitut de Neurosciences de la Timone UMR 7289, CNRS, Aix-Marseille Université, Marseille, France.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Population-wise matching of the cortical folds is necessary to compute statistics, a required step for e.g. identifying biomarkers of neurological or psychiatric disorders. The difficulty arises from the massive inter-individual variations in the morphology and spatial organization of the folds. The task is challenging both methodologically and conceptually. In the widely used registration-based techniques, these variations are considered as noise and the matching of folds is only implicit. Alternative approaches are based on the extraction and explicit identification of the cortical folds. In particular, representing cortical folding patterns as graphs of sulcal basins-termed sulcal graphs-enables to formalize the task as a graph-matching problem. In this paper, we propose to address the problem of sulcal graph matching directly at the population level using multi-graph matching techniques. First, we motivate the relevance of the multi-graph matching framework in this context. We then present a procedure for generating populations of artificial sulcal graphs, which allows us to benchmark several state-of-the-art multi-graph matching methods. Our results on both artificial and real data demonstrate the effectiveness of multi-graph matching techniques in obtaining a population-wise consistent labeling of cortical folds at the sulcal basin level.

Indexed as

Cerebral CortexMagnetic Resonance ImagingAlgorithmsCell MembraneHumansPalliative Care

Identifiers

PMID37943809
PMCPMC10635518

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.