Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is presented, and shown to be effective at solving problems where the point sets are related by a projective transformation. Random starts local search is shown to be capable of solving. very difficult point matching problems, and a heuristic key feature algorithm is presented which can substantially improve the effectiveness of local search in most cases.
Two dimensional projective point matching
2002-01-01
301453 byte
Conference paper
Electronic Resource
English
Two Dimensional Projective Point Matching
British Library Conference Proceedings | 2002
|Robust Point Feature Matching in Projective Space
British Library Conference Proceedings | 2001
|Robust point feature matching in projective space
IEEE | 2001
|Linear projective reconstruction from matching tensors
British Library Online Contents | 1997
|British Library Conference Proceedings | 1999
|