A Feature-Based O(N2) Approach to Point Pattern Matching

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We describe a new algorithm for the astronomical problem of matching star lists, given by their 2-dimensional coordinates. 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 0(n2) computational complexity.

Original languageEnglish
Title of host publicationProceedings of 11th IAPR International Conference on Pattern Recognition
Subtitle of host publicationConference B: Pattern Recognition Methodology and Systems
PublisherIEEE
Pages174-177
Number of pages4
VolumeII
ISBN (Print)0818629150
DOIs
Publication statusPublished - 1992
Externally publishedYes
Event11th IAPR International Conference on Pattern Recognition - The Hague, Netherlands
Duration: 30 Aug 19923 Sep 1992
Conference number: 11

Publication series

NameInternational Conference on Pattern Recognition
PublisherIEEE
Volume2
ISSN (Print)1051-4651

Conference

Conference11th IAPR International Conference on Pattern Recognition
Abbreviated titleIAPR 1992
CountryNetherlands
CityThe Hague
Period30/08/923/09/92

    Fingerprint

Cite this

Murtagh, F. (1992). A Feature-Based O(N2) Approach to Point Pattern Matching. In Proceedings of 11th IAPR International Conference on Pattern Recognition: Conference B: Pattern Recognition Methodology and Systems (Vol. II, pp. 174-177). [201748] (International Conference on Pattern Recognition; Vol. 2). IEEE. https://doi.org/10.1109/ICPR.1992.201748