A feature-based O(N/sup 2/) approach to point pattern matching

Fionn D. Murtagh · 2003

Describes an algorithm for the astronomical problem of matching star lists, given by their 2D coordinates against catalogue information. It is successful at determining mappings between two point sets which are invariant to translation, scaling, perturbation, random insertions and deletions, and rotation. This algorithm is feature-based, and is of O(n/sup 2/) computational complexity.>

Read the paper · More papers on PaperTik