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

F. Murtagh

doi:10.1109/ICPR.1992.201748

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

F. Murtagh

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 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 language	English
Title of host publication	Proceedings of 11th IAPR International Conference on Pattern Recognition
Subtitle of host publication	Conference B: Pattern Recognition Methodology and Systems
Publisher	IEEE
Pages	174-177
Number of pages	4
Volume	II
ISBN (Print)	0818629150
DOIs	https://doi.org/10.1109/ICPR.1992.201748
Publication status	Published - 1992
Externally published	Yes
Event	11th IAPR International Conference on Pattern Recognition - The Hague, Netherlands Duration: 30 Aug 1992 → 3 Sept 1992 Conference number: 11

Publication series

Name	International Conference on Pattern Recognition
Publisher	IEEE
Volume	2
ISSN (Print)	1051-4651

Conference

Conference	11th IAPR International Conference on Pattern Recognition
Abbreviated title	IAPR 1992
Country/Territory	Netherlands
City	The Hague
Period	30/08/92 → 3/09/92

Access to Document

10.1109/ICPR.1992.201748Licence: Unspecified

Cite this

@inproceedings{0e01761428e0423dad19ba9236ceda0b,

title = "A Feature-Based O(N2) Approach to Point Pattern Matching",

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.",

keywords = "Pattern matching, Telescopes, Observatories, Photometry, Packaging, Filters, Detectors, Astronomy, Computer vision, Least squares methods",

author = "F. Murtagh",

year = "1992",

doi = "10.1109/ICPR.1992.201748",

language = "English",

isbn = "0818629150",

volume = "II",

series = "International Conference on Pattern Recognition",

publisher = "IEEE",

pages = "174--177",

booktitle = "Proceedings of 11th IAPR International Conference on Pattern Recognition",

address = "United States",

note = "11th IAPR International Conference on Pattern Recognition, IAPR 1992 ; Conference date: 30-08-1992 Through 03-09-1992",

}

Murtagh, F 1992, A Feature-Based O(N²) Approach to Point Pattern Matching. in Proceedings of 11th IAPR International Conference on Pattern Recognition: Conference B: Pattern Recognition Methodology and Systems. vol. II, 201748, International Conference on Pattern Recognition, vol. 2, IEEE, pp. 174-177, 11th IAPR International Conference on Pattern Recognition, The Hague, Netherlands, 30/08/92. https://doi.org/10.1109/ICPR.1992.201748

A Feature-Based O(N²) Approach to Point Pattern Matching. / Murtagh, F.
Proceedings of 11th IAPR International Conference on Pattern Recognition: Conference B: Pattern Recognition Methodology and Systems. Vol. II IEEE, 1992. p. 174-177 201748 (International Conference on Pattern Recognition; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Murtagh, F.

N1 - Conference code: 11

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

KW - Pattern matching

KW - Telescopes

KW - Observatories

KW - Photometry

KW - Packaging

KW - Filters

KW - Detectors

KW - Astronomy

KW - Computer vision

KW - Least squares methods

UR - https://www.scopus.com/pages/publications/85046005045

U2 - 10.1109/ICPR.1992.201748

DO - 10.1109/ICPR.1992.201748

M3 - Conference contribution

AN - SCOPUS:85046005045

SN - 0818629150

VL - II

T3 - International Conference on Pattern Recognition

SP - 174

EP - 177

BT - Proceedings of 11th IAPR International Conference on Pattern Recognition

PB - IEEE

T2 - 11th IAPR International Conference on Pattern Recognition

Y2 - 30 August 1992 through 3 September 1992

ER -