By Topic

A feature-based O(N2) approach to point pattern matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Murtagh, F. ; Space Telescope-European Coordinating Facility, European Southern Obs., Garching bei Munchen, Germany

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(n2) computational complexity

Published in:

Pattern Recognition, 1992. Vol.II. Conference B: Pattern Recognition Methodology and Systems, Proceedings., 11th IAPR International Conference on

Date of Conference:

30 Aug-3 Sep 1992