Point pattern matching using convex hull edges

Algorithms for matching two sets of points in a plane are given. These algorithms search in the parameter space and find the transformation parameters that can match the most points in two sets. Since an exhaustive search for the best parameters is not affordable as the number of points in the sets become large, a subset selection method is given in order to reduce the search domain. Subsets are chosen as points on the boundary of the convex hulls of the sets. The algorithms are tested on generated and real data, and their performance is compared.

[1]  Charles T. Zahn,et al.  An Algorithm for Noisy Template Matching , 1974, IFIP Congress.

[2]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[3]  George C. Stockman,et al.  Matching Images to Models for Registration and Object Detection via Clustering , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Donald C. S. Allison,et al.  Some performance tests of convex hull algorithms , 1984, BIT.

[5]  Ernest L. Hall,et al.  The Selection of Critical Subsets for Signal, Image, and Scene Matching , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Azriel Rosenfeld,et al.  Some experiments in relaxation image matching using corner features , 1983, Pattern Recognit..

[7]  D Marr,et al.  Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[8]  Azriel Rosenfeld,et al.  Point pattern matching by relaxation , 1980, Pattern Recognit..