The LSST moving object processing pipeline

Kobus Barnard; Andrew Connolly; Larry Denneau; Alon Efrat; Tommy Grav; Jim Heasley; Robert Jedicke; Jeremy Kubica; Bongki Moon; Scott H. Morris; Praveen R. Rao

doi:10.1117/12.671750

30 June 2006 The LSST moving object processing pipeline

Kobus Barnard, Andrew Connolly, Larry Denneau, Alon Efrat, Tommy Grav, Jim Heasley, Robert Jedicke, Jeremy Kubica, Bongki Moon, Scott H. Morris, Praveen R. Rao

Author Affiliations +

Proceedings Volume 6270, Observatory Operations: Strategies, Processes, and Systems; 627024 (2006) https://doi.org/10.1117/12.671750
Event: SPIE Astronomical Telescopes + Instrumentation, 2006, Orlando, Florida , United States

Abstract

We describe a proposed architecture for the Large Synoptic Survey Telescope (LSST) moving object processing pipeline based on a similar system under development for the Pan-STARRS project. This pipeline is responsible for identifying and discovering fast moving objects such as asteroids, updating information about them, generating appropriate alerts, and supporting queries about moving objects. Of particular interest are potentially hazardous asteroids(PHA's). We consider the system as being composed of two interacting components. First, candidate linkages corresponding to moving objects are found by tracking detections ("tracklets"). To achieve this in reasonable time we have developed specialized data structures and algorithms that efficiently evaluate the possibilities using quadratic fits of the detections on a modest time scale. For the second component we take a Bayesian approach to validating, refining, and merging linkages over time. Thus new detections increase our belief that an orbit is correct and contribute to better orbital parameters. Conversely, missed expected detections reduce the probability that the orbit exists. Finally, new candidate linkages are confirmed or refuted based on previous images. In order to assign new detections to existing orbits we propose bipartite graph matching to find a maximum likelihood assignment subject to the constraint that detections match at most one orbit and vice versa. We describe how to construct this matching process to properly deal with false detections and missed detections.

Citation Download Citation

Kobus Barnard, Andrew Connolly, Larry Denneau, Alon Efrat, Tommy Grav, Jim Heasley, Robert Jedicke, Jeremy Kubica, Bongki Moon, Scott H. Morris, and Praveen R. Rao "The LSST moving object processing pipeline", Proc. SPIE 6270, Observatory Operations: Strategies, Processes, and Systems, 627024 (30 June 2006); https://doi.org/10.1117/12.671750

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available