Statistics – Machine Learning
Scientific paper
2010-04-28
Statistics
Machine Learning
19
Scientific paper
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a graph matching problem where one seeks a mapping between vertices of two graphs which optimally aligns their structure. In the classical formulation of graph matching, only one-to-one correspondences between vertices are considered. However, in many applications, graphs cannot be matched perfectly and it is more interesting to consider many-to-many correspondences where clusters of vertices in one graph are matched to clusters of vertices in the other graph. In this paper, we formulate the many-to-many graph matching problem as a discrete optimization problem and propose an approximate algorithm based on a continuous relaxation of the combinatorial problem. We compare our method with other existing methods on several benchmark computer vision datasets.
Bach Francis
Vert Jean-Philippe
Zaslavskiy Mikhail
No associations
LandOfFree
Many-to-Many Graph Matching: a Continuous Relaxation Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Many-to-Many Graph Matching: a Continuous Relaxation Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Many-to-Many Graph Matching: a Continuous Relaxation Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-68332