Reducing process delays for real-time earthquake parameter estimation – An application of KD tree to large databases for Earthquake Early Warning
- Creators
- Yin, Lucy
- Andrews, Jennifer
- Heaton, Thomas
Abstract
Earthquake parameter estimations using nearest neighbor searching among a large database of observations can lead to reliable prediction results. However, in the real-time application of Earthquake Early Warning (EEW) systems, the accurate prediction using a large database is penalized by a significant delay in the processing time. We propose to use a multidimensional binary search tree (KD tree) data structure to organize large seismic databases to reduce the processing time in nearest neighbor search for predictions. We evaluated the performance of KD tree on the Gutenberg Algorithm, a database-searching algorithm for EEW. We constructed an offline test to predict peak ground motions using a database with feature sets of waveform filter-bank characteristics, and compare the results with the observed seismic parameters. We concluded that large database provides more accurate predictions of the ground motion information, such as peak ground acceleration, velocity, and displacement (PGA, PGV, PGD), than source parameters, such as hypocenter distance. Application of the KD tree search to organize the database reduced the average searching process by 85% time cost of the exhaustive method, allowing the method to be feasible for real-time implementation. The algorithm is straightforward and the results will reduce the overall time of warning delivery for EEW.
Additional Information
© 2018 Elsevier Ltd. Received 29 May 2017, Revised 2 December 2017, Accepted 10 January 2018, Available online 11 January 2018.Additional details
- Eprint ID
- 85932
- Resolver ID
- CaltechAUTHORS:20180418-085609694
- Created
-
2018-04-18Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field
- Caltech groups
- Seismological Laboratory, Division of Geological and Planetary Sciences