Improved algorithms for robust point pattern matching and applications to image registration

Abstract

Image registration is the process of determining the transformation that most nearly maps one image to another. An approach based on extracting a set of point features from each of the two images that reduces the problem to a point pattern matching problem is considered. An approximation algorithm called bounded alignment, for robust point pattern matching, is presented. The algorithm operates within the framework of the branch-and-bound, but employs point-to-point alignments to accelerate the search.