A geometric invariant representation for the identification of corresponding points

The identification of the corresponding points between two recordings of a point set has been always an important problem in stereo vision and image registration applications. We propose a geometric invariant representation for each point in order to match the two point patterns and determine their corresponding points. Each point is represented by a feature vector computed in terms of the relative positions of a small number of neighborhood points with respect to the given point. The matching algorithm pairs each point of one set with the most similar one in the other set based on the similarity degree of their feature vectors. A consistent set of corresponding point pairs is therefore extracted independent of any geometrical transformation which may alter one point set with respect to the other one.

[1]  Corneliu Rusu,et al.  Point pattern matching using a genetic algorithm and Voronoi tessellation , 1998, 9th European Signal Processing Conference (EUSIPCO 1998).

[2]  Anil K. Jain,et al.  A Real-Time Matching System for Large Fingerprint Databases , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Rama Chellappa,et al.  A computational vision approach to image registration , 1993, IEEE Trans. Image Process..

[4]  R. Poeckert,et al.  A control point matching algorithm , 1993, Pattern Recognit..

[5]  K. S. Arun,et al.  Least-Squares Fitting of Two 3-D Point Sets , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Sujoy Ghose,et al.  Point matching using asymmetric neural networks , 1993, Pattern Recognit..

[7]  Hiroshi Nagahashi,et al.  Extraction of two-dimensional arbitrary shapes using a genetic algorithm , 1993, Other Conferences.