Many-to-Many Graph Matching: a Continuous Relaxation Approach
Mikhail ZaslavskiyFrancis R. BachJean-Philippe VertPublished in: CoRR (2010)
Keyphrases
- graph matching
- continuous relaxation
- mixed integer
- knapsack problem
- higher dimensional
- linear programming
- graph matching algorithm
- pattern recognition
- pairwise
- object recognition
- point sets
- feasible solution
- network design problem
- prune the search space
- linear program
- matching algorithm
- convex hull
- graph edit distance
- quadratic program
- image matching
- optimal solution
- tabu search
- objective function