Fast matched filter (FMF): An efficient seismic matched-filter search for both CPU and GPU architectures

Eric Beaucé, Alexey Romanenko, William B. Frank

Research output: Contribution to journalArticlepeer-review

22 Citations (Scopus)


Matched-filter searches are an important tool in modern seismology to detect seismic events. They operate via an algorithm that computes the correlation coefficient between a template event and a sliding window of continuous seismic records. A detection is recorded when the correlation coefficient crosses an established threshold. We present an optimized program, called Fast Matched Filter (FMF), that efficiently runs a network-based matched-filter search with either central processing units (CPUs) or NVIDIA graphics processing units (GPUS). Wrappers for both Python andMATLAB (CPU only) are provided to easily run FMF on a wide range of computational resources, from multicore laptops to specialized computing clusters with GPUS. Both implementations leverage a significantly similar structure when it comes to the continuous computation of correlation coefficients in the time domain to achieve rapid performance. The highly parallel architecture of GPUS lends itself perfectly to the matched-filter algorithm, and we achieve the fastest run times with our GPU implementation. FMF allows for seismic network-based matched-filtering between a large set of template waveforms and a large continuous dataset in a reasonable amount of time. Such fast run times are an important step in expanding the scope of earthquake detection and fostering the reproducibility of such studies.

Original languageEnglish
Pages (from-to)165-172
Number of pages8
JournalSeismological Research Letters
Issue number1
Publication statusPublished - 1 Jan 2018




Dive into the research topics of 'Fast matched filter (FMF): An efficient seismic matched-filter search for both CPU and GPU architectures'. Together they form a unique fingerprint.

Cite this