Efficient intra- and inter-night linking of asteroid detections using kd-trees
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
The Panoramic Survey Telescope and Rapid Response System (Pan-STARRS) under development at the University of Hawaii's Institute for Astronomy is creating the first fully automated end-to-end Moving Object Processing System (MOPS) in the world. It will be capable of identifying detections of moving objects in our solar system and linking those detections within and between nights, attributing those detections to known objects, calculating initial and differentially corrected orbits for linked detections, precovering detections when they exist, and orbit identification. Here we describe new kd-tree and variable-tree algorithms that allow fast, efficient, scalable linking of intra and inter-night detections. Using a pseudo-realistic simulation of the Pan-STARRS survey strategy incorporating weather, astrometric accuracy and false detections we have achieved nearly 100% efficiency and accuracy for intra-night linking and nearly 100% efficiency for inter-night linking within a lunation. At realistic sky-plane densities for both real and false detections the intra-night linking of detections into ‘tracks’ currently has an accuracy of 0.3%. Successful tests of the MOPS on real source detections from the Spacewatch asteroid survey indicate that the MOPS is capable of identifying asteroids in real data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Estimation with Applications to Tracking and Navigation: Theory, Algorithms and Software
Bar‐Shalom, Y., Li, X. ‐., & Kirubarajan, T. (2002) · doi:10.1002/0471221279 · Cited by 6,782
Cited by
INITIAL PERFORMANCE OF THE NEOWISE REACTIVATION MISSION
Mainzer, A., Bauer, J., Cutri, R. M., Grav, T., Masiero, J., Beck, R., Clarkson, P., Conrow, T., Dailey, J., Eisenhardt, P., et al. (2014) · The Astrophysical Journal · doi:10.1088/0004-637x/792/1/30 · Cited by 753
Self-citationNEOWISE OBSERVATIONS OF NEAR-EARTH OBJECTS: PRELIMINARY RESULTS
Mainzer, A., Grav, T., Bauer, J., Masiero, J., McMillan, R. S., Cutri, R. M., Walker, R., Wright, E., Eisenhardt, P., Tholen, D. J., et al. (2011) · The Astrophysical Journal · doi:10.1088/0004-637x/743/2/156 · Cited by 439
Self-citationDebiased orbit and absolute-magnitude distributions for near-Earth objects
Granvik, M., Morbidelli, A., Jedicke, R., Bolin, B., Bottke, W. F., Beshore, E., Vokrouhlický, D., Nesvorný, D., & Michel, P. (2018) · Icarus · doi:10.1016/j.icarus.2018.04.018 · Cited by 275
Self-citationThe Pan-STARRS Moving Object Processing System
Denneau, L., Jedicke, R., Grav, T., Granvik, M., Kubica, J., Milani, A., Vereš, P., Wainscoat, R., Chang, D., Pierfederici, F., et al. (2013) · Publications of the Astronomical Society of the Pacific · doi:10.1086/670337 · Cited by 170
Self-citationThe Large Synoptic Survey Telescope as a Near-Earth Object discovery machine
Jones, R. L., Slater, C. T., Moeyens, J., Allen, L., Axelrod, T., Cook, K., Ivezić, Ž., Jurić, M., Myers, J., & Petry, C. E. (2018) · Icarus · doi:10.1016/j.icarus.2017.11.033 · Cited by 81
“…uncertainty is typically of the order of several arcminutes, rather than a degree, which effectively “de-scrambles” detections from different nights (for a detailed discussion of this algorithm, see Kubica et al. 2007 as well as Appendix A for a theoretical derivation of expected scalings).”
BackgroundMethodInfluential
Metadata
- Authors
- Kubica, J., Denneau, L., Grav, T., Heasley, J., Jedicke, R., Masiero, J., Milani, A., Moore, A., Tholen, D., & Wainscoat, R. J.
- Venue
- Icarus
- Publisher
- Elsevier BV
- Published
- 2007-07
- Volume
- 189
- Issue
- 1
- Pages
- 151-168
- ISSN
- 0019-1035 (ISSN-L)
- OpenAlex
- W2096979132
- Cited by
- 66
- References
- 1
- FWCI
- 9.18
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.