Skip to content
Code for the Neurips 2018 paper "(Probably) Concave Graph Matching"
MATLAB C++ M
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
auction
14.off
15.off
CORR_calculate_area.m
PlotResultAfterLocalMinimization.m
README.md
addRot3D.m
chooseFarthestPoints.m
combinator.m
frankWolfeSamplingSolver.m
frankWolfeSamplingSolverOneSided.m
frankWolfeSolver.m
frankWolfeSolverSmartOnesided.m
getPointSamplesByFPS.m
getoptions.m
matchShapes.m
matchShapesOneSided.m
plotMeshAndPoints.m
radial30.m
radial31.m
read_mesh.m
read_off.m
testGeodesicMatching.m
testGeodesicMatchingOneSided.m
triangulation2adjacency.m

README.md

(Probably) Concave Graph Matching

Haggai Maron and Yaron Lipman 32nd Annual Conference on Neural Information Processing Systems (NeurIPS 2018)

Abstract

In this paper we address the graph matching problem. Following the recent works of zaslavskiy2009path,Vestner2017 we analyze and generalize the idea of concave relaxations. We introduce the concepts of conditionally concave and probably conditionally concave energies on polytopes and show that they encapsulate many instances of the graph matching problem, including matching Euclidean graphs and graphs on surfaces. We further prove that local minima of probably conditionally concave energies on general matching polytopes (e.g., doubly stochastic) are with high probability extreme points of the matching polytope (e.g., permutations).

Code

This code implements graph matching with the Frank-Wolfe algorithm, as described in the paper. The examples match two shapes from the SHREC07 dataset. Run matchShapes.m or matchShapesOneSided.m for optimizing over permutations or one-sided permutations repectively.

Disclaimer:

The code is provided as-is for academic use only and without any guarantees. Please contact the authors to report any bugs.

You can’t perform that action at this time.