An excess power statistic for detection of burst sources of gravitational radiation

We examine the properties of an excess power method to detect gravitational waves in interferometric detector data. This method is designed to detect short-duration (< 0.5 s) burst signals of unknown waveform, such as those from supernovae or black hole mergers. If only the bursts' duration and frequency band are known, the method is an optimal detection strategy in both Bayesian and frequentist senses. It consists of summing the data power over the known time interval and frequency band of the burst. If the detector noise is stationary and Gaussian, this sum is distributed as a chi-squared (non-central chi-squared) deviate in the absence (presence) of a signal. One can use these distributions to compute frequentist detection thresholds for the measured power. We derive the method from Bayesian analyses and show how to compute Bayesian thresholds. More generically, when only upper and/or lower bounds on the bursts duration and frequency band are known, one must search for excess power in all concordant durations and bands. Two search schemes are presented and their computational efficiencies are compared. We find that given reasonable constraints on the effective duration and bandwidth of signals, the excess power search can be performed on a single workstation. Furthermore, the method can be almost as efficient as matched filtering when a large template bank is required. Finally, we derive generalizations of the method to a network of several interferometers under the assumption of Gaussian noise.Comment: 22 pages, 6 figure

Matched subspace detection with hypothesis dependent noise power

We consider the problem of detecting a subspace signal in white Gaussian noise when the noise power may be different under the null hypothesis—where it is assumed to be known—and the alternative hypothesis. This situation occurs when the presence of the signal of interest (SOI) triggers an increase in the noise power. Accordingly, it may be relevant in the case of a mismatch between the actual SOI subspace and its presumed value, resulting in a modelling error. We derive the generalized likelihood ratio test (GLRT) for the problem at hand and contrast it with the GLRT which assumes known and equal noise power under the two hypotheses. A performance analysis is carried out and the distributions of the two test statistics are derived. From this analysis, we discuss the differences between the two detectors and provide explanations for the improved performance of the new detector. Numerical simulations attest to the validity of the analysis

One-Class Classification: Taxonomy of Study and Review of Techniques

One-class classification (OCC) algorithms aim to build classification models when the negative class is either absent, poorly sampled or not well defined. This unique situation constrains the learning of efficient classifiers by defining class boundary just with the knowledge of positive class. The OCC problem has been considered and applied under many research themes, such as outlier/novelty detection and concept learning. In this paper we present a unified view of the general problem of OCC by presenting a taxonomy of study for OCC problems, which is based on the availability of training data, algorithms used and the application domains applied. We further delve into each of the categories of the proposed taxonomy and present a comprehensive literature review of the OCC algorithms, techniques and methodologies with a focus on their significance, limitations and applications. We conclude our paper by discussing some open research problems in the field of OCC and present our vision for future research.Comment: 24 pages + 11 pages of references, 8 figure