An optimal algorithm for geometrical congruence
Journal of Algorithms
Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
Model-based image interpretation using genetic algorithms
Image and Vision Computing - Special issue: BMVC 1991
Pattern Recognition Letters
A genetic algorithm for affine invariant recognition of object shapes from broken boundaries
Pattern Recognition Letters
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Genetic Search with Approximate Function Evaluation
Proceedings of the 1st International Conference on Genetic Algorithms
Rigid body constrained noisy point pattern matching
IEEE Transactions on Image Processing
Genetic Fourier descriptor for the detection of rotational symmetry
Image and Vision Computing
Affine invariant matching of broken boundaries based on particle swarm optimization
Image and Vision Computing
A Two-Stage Point Pattern Matching Algorithm Using Ellipse Fitting and Dual Hilbert Scans
IEICE - Transactions on Information and Systems
Affine invariant watermarking algorithm using feature matching
Digital Signal Processing
Pattern Recognition Letters
Multimodal genetic algorithms-based algorithm for automatic point correspondence
Pattern Recognition
Genetic fourier descriptor for the detection of rotational symmetry
WILF'03 Proceedings of the 5th international conference on Fuzzy Logic and Applications
Hi-index | 0.10 |
Point pattern matching (PPM) is an important topic in the fields of computer vision and pattern recognition. According to if there exists a one to one mapping between the two point sets to be matched, PPM can be divided into the case of complete matching and the case of incomplete matching. According to if utilizing information other than 2-D image coordinates, PPM can be divided into labelled point-matching case and unlabelled point-matching case. Using partial Hausdorff distance, this paper presents a genetic algorithm (GA) based method to solve the incomplete unlabelled matching problem under general affine transformation. Since it successfully reduces the solution space of GA by constructing 'feature ellipses' of point sets, the method can achieve high computing efficiency and good matching results. Theoretical analysis and simulation results show that the new algorithm is very effective.