Efficient Algorithms for Large-Scale Asteroid Discovery

Details Efficient Algorithms for Large-Scale Asteroid Discovery Efficient Algorithms for Large-Scale Asteroid Discovery

Oct 2007

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2007aspc..376..395k&link_type=abstract

Astronomical Data Analysis Software and Systems XVI ASP Conference Series, Vol. 376, proceedings of the conference held 15-18 Oc

Statistics

Computation

Scientific paper

The goal of asteroid discovery and linkage is to find sets of individual point detections corresponding to the same new object. However, this conceptually simple goal leads to a computationally expensive question: How do we extract the true associations from the vast number of possibilities? The next generation of sky surveys will provide a wealth of observational data, greatly increasing both the ability to find new objects and the scale of the computational challenge. In this paper we discuss the computational issues inherent in asteroid linkage and discovery for large sky surveys. We present efficient data structures and algorithms to reduce the search space and make the task tractable on massive data sets.

Affiliated with

Also associated with

No associations

Rating

Efficient Algorithms for Large-Scale Asteroid Discovery 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 Efficient Algorithms for Large-Scale Asteroid Discovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Algorithms for Large-Scale Asteroid Discovery will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-955897