4,733 research outputs found
ASTErIsM - Application of topometric clustering algorithms in automatic galaxy detection and classification
We present a study on galaxy detection and shape classification using
topometric clustering algorithms. We first use the DBSCAN algorithm to extract,
from CCD frames, groups of adjacent pixels with significant fluxes and we then
apply the DENCLUE algorithm to separate the contributions of overlapping
sources. The DENCLUE separation is based on the localization of pattern of
local maxima, through an iterative algorithm which associates each pixel to the
closest local maximum. Our main classification goal is to take apart elliptical
from spiral galaxies. We introduce new sets of features derived from the
computation of geometrical invariant moments of the pixel group shape and from
the statistics of the spatial distribution of the DENCLUE local maxima
patterns. Ellipticals are characterized by a single group of local maxima,
related to the galaxy core, while spiral galaxies have additional ones related
to segments of spiral arms. We use two different supervised ensemble
classification algorithms, Random Forest, and Gradient Boosting. Using a sample
of ~ 24000 galaxies taken from the Galaxy Zoo 2 main sample with spectroscopic
redshifts, and we test our classification against the Galaxy Zoo 2 catalog. We
find that features extracted from our pipeline give on average an accuracy of ~
93%, when testing on a test set with a size of 20% of our full data set, with
features deriving from the angular distribution of density attractor ranking at
the top of the discrimination power.Comment: 20 pages, 13 Figures, 8 Tables, Accepted for publication in the
Monthly Notices of the Royal Astronomical Societ
Heaviest Induced Ancestors and Longest Common Substrings
Suppose we have two trees on the same set of leaves, in which nodes are
weighted such that children are heavier than their parents. We say a node from
the first tree and a node from the second tree are induced together if they
have a common leaf descendant. In this paper we describe data structures that
efficiently support the following heaviest-induced-ancestor query: given a node
from the first tree and a node from the second tree, find an induced pair of
their ancestors with maximum combined weight. Our solutions are based on a
geometric interpretation that enables us to find heaviest induced ancestors
using range queries. We then show how to use these results to build an
LZ-compressed index with which we can quickly find with high probability a
longest substring common to the indexed string and a given pattern
A simple hybrid algorithm for improving team sport AI
In the very popular genre of team sports games defeating the opposing AI is the main focus of the gameplay experience. However the overall quality of these games is significantly damaged because, in a lot of cases, the opposition is prone to mistakes or vulnerable to exploitation. This paper introduces an AI system which overcomes this failing through the addition of simple adaptive learning and prediction algorithms to a basic ice hockey defence. The paper shows that improvements can be made to the gameplay experience without overly increasing the implementation complexity of the system or negatively affecting its performance. The created defensive system detects patterns in the offensive tactics used against it and changes elements of its reaction accordingly; effectively adapting to attempted exploitation of repeated tactics. This is achieved using a fuzzy inference system that tracks player movement, which greatly improves variation of defender positioning, alongside an N-gram pattern recognition-based algorithm that predicts the next action of the attacking player. Analysis of implementation complexity and execution overhead shows that these techniques are not prohibitively expensive in either respect, and are therefore appropriate for use in games
- …