First-arrival picking with a U-net convolutional network
Bibliographic record
Abstract
ABSTRACT In exploration geophysics, the first arrivals on data acquired under complicated near-surface conditions are often characterized by significant static corrections, weak energy, low signal-to-noise ratio, and dramatic phase change, and they are difficult to pick accurately with traditional automatic procedures. We have approached this problem by using a U-shaped fully convolutional network (U-net) to first-arrival picking, which is formulated as a binary segmentation problem. U-net has the ability to recognize inherent patterns of the first arrivals by combining attributes of arrivals in space and time on data of varying quality. An effective workflow based on U-net is presented for fast and accurate picking. A set of seismic waveform data and their corresponding first-arrival times are used to train the network in a supervised learning approach, then the trained model is used to detect the first arrivals for other seismic data. Our method is applied on one synthetic data set and three field data sets of low quality to identify the first arrivals. Results indicate that U-net only needs a few annotated samples for learning and is able to efficiently detect first-arrival times with high precision on complicated seismic data from a large survey. With the increasing training data of various first arrivals, a trained U-net has the potential to directly identify the first arrivals on new seismic data.
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.001 |
| 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.000 |
| 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.002 | 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".