Fast and automatic microseismic phase-arrival detection and denoising by pattern recognition and reduced-rank filtering
Bibliographic record
Abstract
ABSTRACT We have developed a fast method that allowed us to automatically detect and denoise microseismic phase arrivals from 3C multichannel data. The method is a two-step process. First, the detection is carried out by means of a pattern recognition strategy that seeks plausible hyperbolic phase arrivals immersed in noisy 3C multichannel data. Then, the microseismic phase arrivals are denoised and reconstructed using a reduced-rank approximation of the singular value decomposition of the data along the detected phase arrivals in the context of a deflation procedure that took into account multiple arrivals and/or phases. For the detection, we have defined an objective function that measured the energy and coherence of a potential microseismic phase arrival along an apex-shifted hyperbolic search window. The objective function, which was maximized using very fast simulated annealing, was based on the energy of the average signal and depended on the source position, receivers geometry, and velocity. In practice, the detection process did not require any a priori velocity model, leading to a fast algorithm that can be used in real time, even when the underlying velocity model was not constant. The reduced-rank filtering coupled with a crosscorrelation-based synchronization strategy allowed us to extract the most representative waveform for all the individual traces. Tests using synthetic and field data have determined the reliability and effectiveness of the proposed method for the accurate detection and denoising of 3C multichannel microseismic events under noisy conditions. Two confidence indicators to assess the presence of an actual phase arrival and the reliability of the denoised individual wave arrivals were also developed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".