REVIEW 1 cited by
SOAP: A generalised application of the Viterbi algorithm to searches for continuous gravitational-wave signals
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
All-sky and wide parameter space searches for continuous gravitational waves are generally template-matching schemes which test a bank of signal waveforms against data from a gravitational wave detector. Such searches can offer optimal sensitivity for a given computing cost and signal model, but are highly-tuned to specific signal types and are computationally expensive, even for semi-coherent searches. We have developed a search method based on the well-known Viterbi algorithm which is model-agnostic and has a computational cost several orders of magnitude lower than template methods, with a modest reduction in sensitivity. In particular, this method can search for signals which have an unknown frequency evolution. We test the algorithm on three simulated and real data sets: gapless Gaussian noise, Gaussian noise with gaps and real data from the final run of initial LIGO (S6). We show that at 95% efficiency, with a 1% false alarm rate, the algorithm has a depth sensitivity of $\sim 33$, $10$ and $13$ ,Hz$^{-1/2}$ with corresponding SNRs of $\sim 60$, $72$ and $74$ in these datasets. we discuss the use of this algorithm for detecting a wide range of quasi-monochromatic gravitational wave signals and instrumental lines.
Forward citations
Cited by 1 Pith paper
-
Applications of machine learning in gravitational wave research with current interferometric detectors
A community review of machine learning in current gravitational-wave detectors, mapping where ML already works in production (noise subtraction, glitch classification, low-latency classification) and where traditional...
Discussion (0). Continue with ORCID to comment.