PROBABILISTIC CROSS-IDENTIFICATION IN CROWDED FIELDS AS AN ASSIGNMENT PROBLEM
Journal Article
·
· Astronomical Journal (Online)
- Dept. of Applied Mathematics and Statistics, Johns Hopkins University, 3400 N. Charles St., MD 21218 (United States)
One of the outstanding challenges of cross-identification is multiplicity: detections in crowded regions of the sky are often linked to more than one candidate associations of similar likelihoods. We map the resulting maximum likelihood partitioning to the fundamental assignment problem of discrete mathematics and efficiently solve the two-way catalog-level matching in the realm of combinatorial optimization using the so-called Hungarian algorithm. We introduce the method, demonstrate its performance in a mock universe where the true associations are known, and discuss the applicability of the new procedure to large surveys.
- OSTI ID:
- 22662958
- Journal Information:
- Astronomical Journal (Online), Vol. 152, Issue 4; Other Information: Country of input: International Atomic Energy Agency (IAEA); ISSN 1538-3881
- Country of Publication:
- United States
- Language:
- English
Similar Records
CROSS-IDENTIFICATION PERFORMANCE FROM SIMULATED DETECTIONS: GALEX AND SDSS
PROBABILISTIC CROSS-IDENTIFICATION OF COSMIC EVENTS
Percolation galaxy groups and clusters in the sdss redshift survey: identification, catalogs, and the multiplicity function
Journal Article
·
Sun Nov 01 00:00:00 EDT 2009
· Astrophysical Journal
·
OSTI ID:22662958
PROBABILISTIC CROSS-IDENTIFICATION OF COSMIC EVENTS
Journal Article
·
Mon Aug 01 00:00:00 EDT 2011
· Astrophysical Journal
·
OSTI ID:22662958
Percolation galaxy groups and clusters in the sdss redshift survey: identification, catalogs, and the multiplicity function
Journal Article
·
Sun Jan 01 00:00:00 EST 2006
·
OSTI ID:22662958
+16 more