GMWASC: Graph matching with weighted affine and sparse constraints

Graph Matching (GM) plays an essential role in computer vision and machine learning. The ability of using pairwise agreement in GM makes it a powerful approach in feature matching. In this paper, a new formulation is proposed which is more robust when it faces with outlier points. We add weights to the one-to-one constraints, and modify them in the process of optimization in order to diminish the effect of outlier points in the matching procedure. We execute our proposed method on different real and synthetic databases to show both robustness and accuracy in contrast to several conventional GM methods.