Relaxation Labeling for Contour Point Matching under Affine Transformations

A matching between two sets of points under affine transformations has attracted more and more attention. Many algorithms devote to extracting the descriptor for the point from the configuration, and the descriptor based point matching is achieved ignoring the pairwise geometric relations. In this paper, taking advantage of the inlier correspondences in matched configurations, we formalize a soft matching criterion which emerges from a matching probability matrix, followed by a relaxation labeling process to refine the match. The proposed approach has been implemented and gives encouraging results under rotation, scaling, shearing and noise.