Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching
arXiv:1311.6425
Abstract
Graph matching is a challenging problem with very important applications in a wide range of fields, from image and video analysis to biological and biomedical problems. We propose a robust graph matching algorithm inspired in sparsity-related techniques. We cast the problem, resembling group or collaborative sparsity formulations, as a non-smooth convex optimization problem that can be efficiently solved using augmented Lagrangian techniques. The method can deal with weighted or unweighted graphs, as well as multimodal data, where different graphs represent different types of data. The proposed approach is also naturally integrated with collaborative graph inference techniques, solving general network inference problems where the observed variables, possibly coming from different modalities, are not in correspondence. The algorithm is tested and compared with state-of-the-art graph matching techniques in both synthetic and real graphs. We also present results on multimodal graphs and applications to collaborative inference of brain connectivity from alignment-free functional magnetic resonance imaging (fMRI) data. The code is publicly available.
arXiv commentNIPS 2013
References in corpus (6)
- Emergence of scaling in random networks
- Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation
- Structural Properties of the Caenorhabditis elegans Neuronal Network
- Community structure and scale-free collections of Erdös-Rényi graphs
- Brain covariance selection: better individual functional connectivity models using population prior
- Fast Approximate Quadratic Programming for Large (Brain) Graph Matching
Cited by in corpus (6)
- Seeded graph matching for correlated Erdős-Rényi graphs
- Stochastic Optimization of Sorting Networks via Continuous Relaxations
- Manifold Matching using Shortest-Path Distance and Joint Neighborhood Selection
- Graph Matching with Partially-Correct Seeds
- Sorting Network Relaxations for Vector Permutation Problems
- Permutation-Invariant Subgraph Discovery