Population-wise Labeling of Sulcal Graphs using Multi-graph Matching

01/31/2023
by   Rohit Yadav, et al.
0

Population-wise matching of the cortical fold is necessary to identify biomarkers of neurological or psychiatric disorders. The difficulty comes from the massive interindividual variations in the morphology and spatial organization of the folds. This task is challenging at both methodological and conceptual levels. 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 multi-graph matching framework in this context. We then introduce a procedure to generate populations of artificial sulcal graphs, which allows us benchmarking 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 to obtain a population-wise consistent labeling of cortical folds at the sulcal basins level.

READ FULL TEXT

page 3

page 7

page 16

page 20

page 22

page 36

research
09/03/2012

Seeded Graph Matching

Given two graphs, the graph matching problem is to align the two vertex ...
research
11/22/2016

Distributable Consistent Multi-Graph Matching

In this paper we propose an optimization-based framework to multiple gra...
research
02/14/2020

Graph Deconvolutional Generation

Graph generation is an extremely important task, as graphs are found thr...
research
09/14/2018

Elastic Registration of Geodesic Vascular Graphs

Vascular graphs can embed a number of high-level features, from morpholo...
research
12/16/2021

iGraphMatch: an R Package for the Analysis of Graph Matching

iGraphMatch is an R package for finding corresponding vertices between t...
research
06/05/2020

Graph matching beyond perfectly-overlapping Erdős–Rényi random graphs

Graph matching is a fruitful area in terms of both algorithms and theori...
research
01/11/2023

AGMN: Association Graph-based Graph Matching Network for Coronary Artery Semantic Labeling on Invasive Coronary Angiograms

Semantic labeling of coronary arterial segments in invasive coronary ang...

Please sign up or login with your details

Forgot password? Click here to reset