Statistics – Computation
Scientific paper
Apr 1992
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1992pasp..104..301m&link_type=abstract
Astronomical Society of the Pacific, Publications (ISSN 0004-6280), vol. 104, no. 674, April 1992, p. 301-307.
Statistics
Computation
3
Algorithms, Astronomical Coordinates, Data Processing, Pattern Recognition, Stars, Astronomical Catalogs, Lists, Matching, Stellar Motions
Scientific paper
A new algorithm for matching star lists, given by their two-dimensional coordinates, is discussed. Such matching should be unaffected by translation, rotation, rescaling, random perturbations, and some random additions and deletions of coordinate couples in one list relative to another. The first phase of the algorithm is based on a characterization of a set of coordinate couples, relative to each individual coordinate couple. In the second phase of the algorithm, the matching of stars in different lists is based on proximity of feature vectors associated with coordinate couples in the two lists. The order of magnitude computational complexity of the overall algorithm is n-squared for O(n) coordinate couples in the coordinate lists.
No associations
LandOfFree
A new approach to point-pattern matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A new approach to point-pattern matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new approach to point-pattern matching will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1739648