Implicit neural representations for self-supervised seismic deblending
Bibliographic record
Abstract
ABSTRACT Blended acquisition enables near-simultaneous firing of multiple shots, facilitating faster and denser seismic data collection, which reduces acquisition time, lowers costs, and potentially enhances subsurface illumination. However, these benefits require an additional deblending process to recover the seismic data one would have acquired via a conventional survey. Numerous data-driven deblending algorithms have emerged, predominantly relying on supervised deep learning. Nevertheless, constructing training pairs that are representative and transferable to complex field data remains challenging. Some unsupervised methods have been developed, but they often focus on local similarities within individual seismic data, neglecting the continuity of seismic wavefields and relationships between different data across the entire data set. Implicit neural representation (INR) provides a versatile framework for modeling continuous seismic signals using neural network parameterized functions, capturing the intrinsic relationships throughout the entire data set. Building on this advantage, this study introduces INR for self-supervised seismic deblending. Specifically, to capitalize on the prior knowledge that desired unblended signals in nearby unblended common-receiver gathers (CRGs) vary smoothly due to the continuity of seismic waveforms, a deep neural network is used as an implicit function to parameterize desired unblended CRGs with receiver indices as inputs. By leveraging the blending operator, a physics-informed training strategy is implemented to enforce measurement consistency, enabling the trained network to recover corresponding deblended CRGs accurately. Numerical experiments conducted on synthetic and field data sets demonstrate the efficacy of our approach. Compared with sparsity-promoting inversion with a patched 2D Fourier transform, a widely adopted method in the industry, and the plug-and-play method with blind-spot networks, one of the most widely accepted self-supervised approaches, our method shows superior performance.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".