SiGMa-Net: Deep learning network to distinguish binary black hole signals from short-duration noise transients

Choudhary, Sunil ; More, Anupreeta ; Suyamprakasam, Sudhagar ; Bose, Sukanta (2022) SiGMa-Net: Deep learning network to distinguish binary black hole signals from short-duration noise transients Arxiv-eprints .

[img] PDF
942kB

Official URL: https://arxiv.org/abs/2202.08671

Abstract

Blip glitches, a type of short-duration noise transient in the LIGO--Virgo data, are a nuisance for the binary black hole (BBH) searches. They affect the BBH search sensitivity significantly because their time-domain morphologies are very similar, and that creates difficulty in vetoing them. In this work, we construct a deep-learning neural network to efficiently distinguish BBH signals from blip glitches. We introduce sine-Gaussian projection (SGP) maps, which are projections of GW frequency-domain data snippets on a basis of sine-Gaussians defined by the quality factor and central frequency. We feed the SGP maps to our deep-learning neural network, which classifies the BBH signals and blips. Whereas the BBH signals are simulated, the blips used are taken from real data throughout our analysis. We show that our network significantly improves the identification of the BBH signals in comparison to the results obtained using traditional-\chi^2χ 2 and sine-Gaussian \chi^2χ 2 . For example, our network improves the sensitivity by 75% at a false-positive rate of 10^{-2}10 −2 for BBHs with total mass in the range [80,140]~M_{\odot}[80,140] M ⊙ ​ and SNR in the range [3,8][3,8]. Also, it correctly identifies 95% of the real GW events in GWTC-3. The computation time for classification is a few minutes for thousands of SGP maps on a single core. With further optimisation in the next version of our algorithm, we expect a further reduction in the computational cost. Our proposed method can potentially improve the veto process in the LIGO--Virgo GW data analysis and conceivably support identifying GW signals in low-latency pipelines.

Item Type:Article
Source:Copyright of this article belongs to Arxiv Publications.
ID Code:134830
Deposited On:13 Jan 2023 05:30
Last Modified:13 Jan 2023 05:30

Repository Staff Only: item control page