Many-to-Many Graph Matching: A Continuous Relaxation Approach.
Mikhail ZaslavskiyFrancis R. BachJean-Philippe VertPublished in: ECML/PKDD (3) (2010)
Keyphrases
- graph matching
- continuous relaxation
- knapsack problem
- mixed integer
- higher dimensional
- linear programming
- graph matching algorithm
- pattern recognition
- matching algorithm
- pairwise
- point sets
- graph edit distance
- object recognition
- prune the search space
- quadratic program
- convex hull
- linear program
- optimal solution
- feasible solution
- pattern matching
- network design problem
- image processing
- lot sizing
- euclidean space
- vector space
- image matching
- objective function
- inexact graph matching
- lower bound
- neural network