A robust Graph Transformation Matching for non-rigid registration

摘要

In this paper, we propose a simple and highly robust point-matching method named Graph Transformation Matching (GTM) relying on finding a consensus nearest-neighbour graph emerging from candidate matches. The method iteratively eliminates dubious matches in order to obtain the consensus graph. The proposed technique is compared against both the Softassign algorithm and a combination of RANSAC and epipolar constraint. Among these three techniques, GTM demonstrates to yield the best results in terms of elimination of outliers. The algorithm is shown to be able to deal with difficult cases such as duplication of patterns and non-rigid deformations of objects. An execution time comparison is also presented, where GTM shows to be also superior to RANSAC for high outlier rates. In order to improve the performance of GTM for lower outlier rates, we present an optimised version of the algorithm. Lastly, GTM is successfully applied in the context of constructing mosaics of retinal images, where feature points are extracted from properly segmented binary images. Similarly, the proposed method could be applied to a number of other important applications.