mlsanityData to 7 Oct 2026

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

arXiv 2301.13532 ↗First posted 31 Jan 2023stat.ML cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 104 references that are in the map. First posted on arXiv 31 Jan 2023.

Builds on

17 of 104 references.

References · 17

  1. 2018How Powerful are Graph Neural Networks?cited by 4,355
  2. 2014Matrix Completion and Low-Rank SVD via Fast Alternating Least Squarescited by 104
  3. 2019Learning Combinatorial Embedding Networks for Deep Graph Matchingcited by 98
  4. 2020Deep Graph Matching Consensuscited by 85
  5. 2019Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matchingcited by 83
  6. 2020Deep Graph Matching via Blackbox Differentiation of Combinatorial Solverscited by 81
  7. 2015Multi-Image Matching via Fast Alternating Minimizationcited by 33
  8. 2018Higher-order Projected Power Iterations for Scalable Multi-Matchingcited by 24
  9. 2014Near-Optimal Joint Object Matching via Convex Relaxationcited by 17
  10. 2017Multi-Image Semantic Matching by Mining Consistent Featurescited by 13
  11. 2019KerGM: Kernelized Graph Matchingcited by 13
  12. 2015A General Multi-Graph Matching Approach via Graduated Consistency-regularized Boostingcited by 12
5 more
  1. 2020Robust Multi-object Matching via Iterative Reweighting of the Graph Connection Laplaciancited by 10
  2. 2016Quantum Optimal Transport for Tensor Field Processingcited by 7
  3. 2022A Graph Is More Than Its Nodes: Towards Structured Uncertainty-Aware Learning on Graphscited by 6
  4. 2022Kernelized multi-graph matchingcited by 3
  5. 2022Universe Points Representation Learning for Partial Multi-Graph Matchingcited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.