Detecting highly oscillatory signals by chirplet path pursuit

• Published in: Applied and computational harmonic analysis Vol. 24; no. 1; pp. 14 - 40
• Main Authors: Candès, Emmanuel J., Charlton, Philip R., Helgason, Hannes
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 2008
• Subjects: Adaptivity; Chirplets; Chirps; Dynamic programming; Graphs; Gravitational waves; Likelihood ratios; Nonparametric testing; Shortest path in a graph; Signal detection; Time–frequency analysis; Adaptivity; Shortest path in a graph; Likelihood ratios; Nonparametric testing; Gravitational waves; Graphs; Time–frequency analysis; Dynamic programming; Chirplets; Signal detection; Chirps
• ISSN: 1063-5203; 1096-603X
• DOI: 10.1016/j.acha.2007.04.003

This paper considers the problem of detecting nonstationary phenomena, and chirps in particular, from very noisy data. Chirps are waveforms of the very general form A ( t ) exp ( ı λ φ ( t ) ) , where λ is a (large) base frequency, the phase φ ( t ) is time-varying and the amplitude A ( t ) is slowly varying. Given a set of noisy measurements, we would like to test whether there is signal or whether the data is just noise. One particular application of note in conjunction with this problem is the detection of gravitational waves predicted by Einstein's Theory of General Relativity. We introduce detection strategies which are very sensitive and more flexible than existing feature detectors. The idea is to use structured algorithms which exploit information in the so-called chirplet graph to chain chirplets together adaptively as to form chirps with polygonal instantaneous frequency. We then search for the path in the graph which provides the best trade-off between complexity and goodness of fit. Underlying our methodology is the idea that while the signal may be extremely weak so that none of the individual empirical coefficients is statistically significant, one can still reliably detect by combining several coefficients into a coherent chain. This strategy is general and may be applied in many other detection problems. We complement our study with numerical experiments showing that our algorithms are so sensitive that they seem to detect signals whenever their strength makes them detectable by any method.