Related papers: A MST algorithm for source detection in gamma-ray …
The minimal spanning tree (MST) algorithm is a graph-theoretical cluster-finding method. We previously applied it to gamma-ray bidimensional images, showing that it is quite sensitive in finding faint sources. Possible sources are…
We present the topometric MST method to search for clusters of photons in the LAT sky, which was used to obtain the seed list for the compilation of the First LAT catalog. This method works well in non-dense field and can be profitably used…
We present the results of a photon cluster search in the 7-years Fermi-Large Area Telescope extragalactic Pass 8 gamma-ray sky by means of the Minimum Spanning Tree (MST) algorithm, at energies higher than 10 GeV. We found 16 clusters of…
In this paper we show an application of the Minimum Spanning Tree (MST) clustering method to the high-energy gamma-ray sky observed at energies higher than 10 GeV in 6.3 years by the Fermi-Large Area Telescope. We report the detection of 19…
We present the results of a photon cluster search in the gamma-ray sky observed by the Fermi Large Area Telescope, using the new Pass 8 dataset, at energies higher than 10 GeV. By means of the Minimum Spanning Tree (MST) algorithm, we found…
We describe a catalogue of gamma-ray source candidates, selected using the Minimum Spanning Tree (MST) algorithm on the 9-years Fermi-LAT sky (Pass 8) at energies higher than 10 GeV. The extragalactic sky at absolute Galactic latitudes…
We present the results of a cluster search in the Fermi-LAT Pass 8 gamma-ray sky by means of the Minimum Spanning Tree algorithm, at energies higher than 10 GeV and at Galactic latitudes higher than 25 degrees. The selected clusters have a…
In this paper, we study the form over the minimum spanning tree problem (MST) from which we will derive an intuitively generalized model and new methods with the upper bound of runtimes of logarithm. The new pattern we made has taken…
We present an updated version catalogue of gamma-ray source candidates, 12Y-MST, selected using the minimum spanning tree (MST) algorithm on the 12-year Fermi-LAT sky (Pass 8) at energies higher than 10 GeV. The high-energy sky at absolute…
Most of the existing clustering methods are based on a single granularity of information, such as the distance and density of each data. This most fine-grained based approach is usually inefficient and susceptible to noise. Therefore, we…
We use the Minimal Spanning Tree to characterize the aggregation level of given sets of points. We test 3 distances based on the histogram of the MST edges to discriminate between the distributions. We calibrate the method by using…
Searching for as yet undetected gamma-ray sources is a major target of the Fermi LAT Collaboration. We present an algorithm capable of identifying such type of sources by non-parametrically clustering the directions of arrival of the…
Minimum spanning trees (MSTs) provide a convenient representation of datasets in numerous pattern recognition activities. Moreover, they are relatively fast to compute. In this paper, we quantify the extent to which they are meaningful in…
Finding a minimum spanning tree (MST) for $n$ points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes $\Omega(n^2)$ time to even approximate. We introduce a…
Due to their computational complexity, graph cuts for cluster detection and identification are used mostly in the form of convex relaxations. We propose to utilize the original graph cuts such as Ratio, Normalized or Cheeger Cut to detect…
We present an algorithm capable of detecting diffuse, dim sources of any size in an astronomical image. These sources often defeat traditional methods for source finding, which expand regions around points of high intensity. Extended…
Targeted color-dots with varying shapes and sizes in images are first exhaustively identified, and then their multiscale 2D geometric patterns are extracted for testing spatial uniformness in a progressive fashion. Based on color theory in…
In this paper we present and evaluate a parallel algorithm for solving a minimum spanning tree (MST) problem for supercomputers with distributed memory. The algorithm relies on the relaxation of the message processing order requirement for…
We present a new detection algorithm based on the wavelet transform for the analysis of high energy astronomical images. The wavelet transform, due to its multi-scale structure, is suited for the optimal detection of point-like as well as…
The minimum spanning tree (MST), a graph constructed from a distribution of points, draws lines between pairs of points so that all points are linked in a single skeletal structure that contains no loops and has minimal total edge length.…