Skip to Main content Skip to Navigation
Conference papers

On the relevance of multi-graph matching for sulcal graphs

Abstract : Fine-scale characterization of the geometry of the folding patterns of the brain is a key processing step in neuroscience, with high impact applications such as for uncovering biomarkers indicative of a neurological pathology. Sulcal graphs constitute relevant representations of the complex and variable geometry of the cortex of individual brains. Comparing sulcal graphs is challenging due to variations across subjects in the number of nodes, graph topology and attributes (on both nodes and edges). Graph matching experiments on real data are limited by the absence of ground truth. In this paper we propose to generate synthetic graphs to benchmark graph matching methods and assess their robustness to noise on attributes and to the presence of un-matchable nodes. Three multi-graph matching methods are compared to one pairwise approach in various simulation settings, showing that good matching performances can be achieved even with highly perturbed sulcal graphs. An experiment on real data from a population of 134 subjects further unveil large performance differences across matching methods.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03776013
Contributor : guillaume Auzias Connect in order to contact the contributor
Submitted on : Tuesday, September 13, 2022 - 11:43:08 AM
Last modification on : Wednesday, September 14, 2022 - 4:04:44 AM

File

Yadav_ICIP_2022.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03776013, version 1

Citation

R Yadav, François-Xavier Dupé, S Takerkart, G Auzias. On the relevance of multi-graph matching for sulcal graphs. IEEE International Conference on Image Processing (ICIP 2022), Oct 2022, Bordeaux, France. ⟨hal-03776013⟩

Share

Metrics

Record views

0

Files downloads

0