Cluster Detection in Astronomical Databases: the Adaptive Matched Filter Algorithm and Implementation

Details Cluster Detection in Astronomical Databases: the Adaptive Matched Filter Algorithm and Implementation Cluster Detection in Astronomical Databases: the Adaptive Matched Filter Algorithm and Implementation

2000-04-21

arxiv.org/abs/astro-ph/0004304v1

Astronomy and Astrophysics

Astrophysics

Submitted to Data Mining and Knowledge Discovery; 25 pages including 13 color figures

Scientific paper

Clusters of galaxies are the most massive objects in the Universe and mapping their location is an important astronomical problem. This paper describes an algorithm (based on statistical signal processing methods), a software architecture (based on a hybrid layered approach) and a parallelization scheme (based on a client/server model) for finding clusters of galaxies in large astronomical databases. The Adaptive Matched Filter (AMF) algorithm presented here identifies clusters by finding the peaks in a cluster likelihood map generated by convolving a galaxy survey with a filter based on a cluster model and a background model. The method has proved successful in identifying clusters in real and simulated data. The implementation is flexible and readily executed in parallel on a network of workstations.

Affiliated with

Also associated with

No associations

Rating

Cluster Detection in Astronomical Databases: the Adaptive Matched Filter Algorithm and Implementation 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 Cluster Detection in Astronomical Databases: the Adaptive Matched Filter Algorithm and Implementation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cluster Detection in Astronomical Databases: the Adaptive Matched Filter Algorithm and Implementation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-516799