Matching Waveform Envelopes for Earthquake Early Warning

Current earthquake early warning (EEW) algorithms are continuously optimized to strive for fast, accurate source parameter estimates for the rupturing earthquake (i.e. magnitude, location), which are then used to predict ground motions expected at a site. However, they may still struggle with challenging cases, such as offshore events and complex sequences. An envelope-based two-part search algorithm is developed to handle such cases. This algorithm matches different templates to the incoming observed ground motion envelopes to find the optimal earthquake source parameter estimates. The algorithm consists of two methods. Method I is the standard grid search, and it uses Cua-Heaton ground motion envelopes as its templates; Method II is the extended catalog search, and its templates are waveform envelopes from past real and synthetic earthquakes. The grid search is intended for robustness and provides approximate average solutions, whereas the extended catalog search matches envelopes considering the station’s specific site and path effects. In parallel execution, Methods I and II work together – either by confirming each other’s solutions or accepting the solution with stronger fits – to provide the best parameter estimates based on waveform-based data. \ud The main advantage of the two-part search algorithm is its ability to find parameter estimates of reduced uncertainties using the P-wave data from a single station. Many algorithms wait until multiple stations are triggered to reduce tradeoffs between the magnitude and location. This waiting time, however, is detrimental in EEW, for it jeopardizes the warning time that can be issued to nearby regions expected to experience strong shaking. The use of a single station would virtually eliminate this waiting time, maximizing the warning time without the cost in accuracy of the estimates. Because EEW is a race against time, further actions are taken for more rapid estimation of the earthquake source parameters. A Bayesian approach using prior information has the potential to reduce uncertainties that arise in the initial time points due to tradeoffs between the magnitude and location. This essentially increases the confidence of the initial parameter estimates, allowing alerts to be issued faster. A KD tree nearest neighbor search is also introduced to reduce latency in the time it takes to find the best-fitting solutions. In comparison to an exhaustive, brute-force search, it cuts the searching time by only examining through a fraction of the total database. An envelope-based algorithm examines the shape and relative frequency content and makes appropriate judgments, just as a human seismologist would; it also addresses the issue of data transmission latencies. Overall, this algorithm is able to interpret the complexity of earthquakes and assess the features they hold to ultimately communicate information of significant ground shaking to different regions.