A fine‐tuning workflow for automatic first‐break picking with deep learning
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract First‐break picking is an essential step in seismic data processing. For reliable results, first arrivals should be picked by an expert. This is a time‐consuming procedure and subjective to a certain degree, leading to different results for different operators. In this study, we have used a U‐Net architecture with residual blocks to perform automatic first‐break picking based on deep learning. Focusing on the effects of weight initialization on first‐break picking, we conduct this research by using the weights of a pre‐trained network that is used for object detection on the ImageNet dataset. The efficiency of the proposed method is tested on two real datasets. For both datasets, we pick manually the first breaks for less than 10 of the seismic shots. The pre‐trained network is fine‐tuned on the picked shots, and the rest of the shots are automatically picked by the neural network. It is shown that this strategy allows to reduce the size of the training set, requiring fine‐tuning with only a few picked shots per survey. Using random weights and more training epochs can lead to a lower training loss, but such a strategy leads to overfitting as the test error is higher than the one of the pre‐trained network. We also assess the possibility of using a general dataset by training a network with data from three different projects that are acquired with different equipment and at different locations. This study shows that if the general dataset is created carefully it can lead to more accurate first‐break picking; otherwise, the general dataset can decrease the accuracy. Focusing on near‐surface geophysics, we perform traveltime tomography and compare the inverted velocity models based on different first‐break picking methodologies. The results of the inversion show that the first breaks obtained by the pre‐trained network lead to a velocity model that is closer to the one obtained from the inversion of expert‐picked first breaks.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it