Skip to Main Content
A crucial problem that involves feature-based image registration algorithms is how to reliably establish the correspondence between the features detected in the sensed image and those detected in the reference image. Generally, most existing methods only use spatial relations or feature similarity, or a simple combination of them, to solve this problem, and all have some limitations. In this paper, a new feature-matching strategy is developed. It is realized by introducing a function whose independent variable is the match matrix, which describes the correspondence of the features, to combine spatial relations and organically feature similarity, and its global maximum is assumed to be reached if the sensed image is completely aligned with the reference image. Thus, the feature correspondence can be estimated by finding the maximum of the function. Two approaches are devised to solve the optimization problem. One is based on the branch-and-bound strategy to yield a global optimal solution, and the other uses an iterative algorithm that combines graduated assignment and variable metric methods to search for a local optimal solution with low computational complexity. The proposed method can work without the limitations of feature type, similarity criterion, and transform model, and its performance is evaluated using a variety of real images. Compared with some existing methods, it is fast and robust, and has the highest accuracy.