In this paper we consider the pairwise graph matching problem of finding correspondences between two point sets using unary and pairwise potentials, which analyze local descriptor similarity and geometric compatibility. Recently, it was shown that it is possible to learn optimal parameters for the features used in the potentials, which significantly improves results in supervised and unsupervised settings. It was demonstrated that even linear assignments (not considering geometry) with well learned potentials may improve over state-of-the-art quadratic assignment solutions. In this paper we extend this idea by directly learning edge-specific kernels for pairs of nodes. We define the pairwise kernel functions based on a statistical shape model that is learned from labeled training data. Assuming that the setting of graph matching is a priori known, the learned kernel functions allow to significantly improve results in comparison to general graph matching. We further demonstrate the applicability of game theory based evolutionary dynamics as effective and easy to implement approximation of the underlying graph matching optimization problem. Experiments on automatically aligning a set of faces and feature-point based localization of category instances demonstrate the value of the proposed method.
|Titel||Proceedings of the British Machine Vision Conference|
|Redakteure/-innen||Richard Bowden, John Collomosse, Krystian Mikolajczyk|
|Herausgeber (Verlag)||The British Machine Vision Association|
|Publikationsstatus||Veröffentlicht - 2012|
Fields of Expertise
- Information, Communication & Computing
Donoser, M., Urschler, M., & Bischof, H. (2012). Learning Edge-Specific Kernel Functions for Pairwise Graph Matching. in R. Bowden, J. Collomosse, & K. Mikolajczyk (Hrsg.), Proceedings of the British Machine Vision Conference (S. 17.1-17.12). The British Machine Vision Association. https://doi.org/10.5244/C.26.17