A Minimal Spanning Tree algorithm for source detection in γ-ray images

39Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We developed a source detection algorithm based on the Minimal Spanning Tree (MST), that is a graph-theoretical method useful for finding clusters in a given set of points. This algorithm is applied to γ-ray bi-dimensional images where the points correspond to the arrival direction of photons, and the possible sources are associated with the regions where they clusterize. Some filters to select these clusters and to reduce the spurious detections are introduced. An empirical study of the statistical properties of MST on random fields is carried out in order to derive some criteria to estimate the best filter values. We also introduce two parameters useful to verify the goodness of candidate sources. To show how the MST algorithm works in practice, we present an application to an EGRET observation of the Virgo field, at high Galactic latitude and with a low and rather uniform background, in which several sources are detected. © 2007 RAS.

Cite

CITATION STYLE

APA

Campana, R., Massaro, E., Gasparrini, D., Cutini, S., & Tramacere, A. (2008). A Minimal Spanning Tree algorithm for source detection in γ-ray images. Monthly Notices of the Royal Astronomical Society, 383(3), 1166–1174. https://doi.org/10.1111/j.1365-2966.2007.12616.x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free