Share Email Print

Proceedings Paper

Efficiently identifying close track/observation pairs in continuous timed data
Author(s): Jeremy Kubica; Andrew Moore; Andrew Connolly; Robert Jedicke
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper we examine new data structures and algorithms for efficient and accurate gating and identification of potential track/observation associations. Specifically, we focus on the problem of continuous timed data, where observations arrive over a range of time and each observation may have a unique time stamp. For example, the data may be a continuous stream of observations or consist of many small observed subregions. This contrasts with previous work in accelerating this task, which largely assumes that observations can be treated as arriving in batches at discrete time steps. We show that it is possible to adapt established techniques to this modified task and introduce a novel data structure for tractably dealing with very large sets of tracks. Empirically we show that these data structures provide a significant benefit in both decreased computational cost and increased accuracy when contrasted with treating the observations as if they occurred at discrete time steps.

Paper Details

Date Published: 15 September 2005
PDF: 12 pages
Proc. SPIE 5913, Signal and Data Processing of Small Targets 2005, 59130S (15 September 2005); doi: 10.1117/12.617607
Show Author Affiliations
Jeremy Kubica, Carnegie Mellon Univ. (United States)
Andrew Moore, Carnegie Mellon Univ. (United States)
Andrew Connolly, Univ. of Pittsburgh (United States)
Robert Jedicke, Institute for Astronomy (United States)

Published in SPIE Proceedings Vol. 5913:
Signal and Data Processing of Small Targets 2005
Oliver E. Drummond, Editor(s)

© SPIE. Terms of Use
Back to Top