Interactive graph matching by means of imposing the pairwise costs

We present a method to perform graph matching in which the human can interact and impose part of the graph labelling. Humans are very good at finding the correspondences between parts of two images but finding these correspondences is one of the most difficult tasks in pattern recognition. Through simple actions such as impose a node labelling or consider a node labelling is not correct; the user helps the automatic graph-matching algorithm to decide a labelling that is closer to the one that the human desires. This interaction is done through the modification of the initial pairwise costs. The method is independent on the graph-matching algorithm. Practical evaluation, in which the Graduated Assignment has been used, shows that with few interactions, the algorithm arrives at the ideal labelling.