An image registration algorithm with the constraint of Delaunay triangulation

In traditional matching of feature points, only information of the characteristic themselves were considered. In order to overcome the problem of this, an image matching algorithm based on Delaunay triangulation is given. In the proposed algorithm, the candidate feature points are Delaunay triangulated. The graphics after triangulated are compared and the consistent structure is located. The consistent structure is corresponding to correct matching. The proposed algorithm can effectively eliminate wrong match points and enhance reliability. And compared to RANSAC (Random Sample Consensus, RANSAC), the proposed algorithm achieves substantial reduction in computing time. The experiments show that the effectiveness and reliability of the proposed algorithm, which probably be with importance in application.