Robust unsupervised 5D seismic data reconstruction on regular and irregular grids
Bibliographic record
Abstract
ABSTRACT Seismic data reconstruction has become a central focus in seismic data processing, addressing challenges posed by sparse sampling due to physical and budgetary constraints. The advent of 5D acquisition methodologies marks a significant advancement in the quality and completeness of seismic data sets. Most traditional 5D reconstruction methods commonly use the fast Fourier transform (FFT), requiring regular grids and preliminary 4D binning before 5D interpolation. Discrete Fourier transform and nonequidistant FFT can honor the original irregular coordinates. However, when using exact locations, these methods become computationally expensive. We introduce an unsupervised deep-learning methodology to learn a continuous function across the sampling points in seismic data, facilitating reconstruction on regular and irregular grids. The network comprises a multilayer perceptron with linear layers and element-wise periodic activation functions. It excels at mapping the input coordinates to the corresponding seismic data amplitudes without relying on external training sets. The network’s intrinsic low-frequency bias is crucial in prioritizing acquiring self-similar features over high-frequency and incoherent ones during training. This characteristic mitigates incoherent noise in seismic data, such as random and erratic components. To assess the robustness of the unsupervised reconstruction technique, we conduct comprehensive evaluations using synthetic data examples sampled regularly and irregularly, as well as field-data examples with and without binning. The findings demonstrate the efficacy of our deep-learning framework in achieving resilient and accurate seismic data reconstruction across diverse sampling scenarios.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| 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.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 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".