Iterative Deblending of Simultaneous-Source Seismic Data via a Robust Singular Spectrum Analysis Filter
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
We solve the simultaneous source separation problem by adopting the projected gradient descent (PGD) method to iteratively estimate the data one would acquire via a conventional seismic acquisition. The projection operator is a windowed robust singular spectrum analysis (SSA) filter that suppresses source interferences in the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$f-x$ </tex-math></inline-formula> (frequency-space) domain. We reformulate the SSA filter as a robust optimization problem solved via a bifactored gradient descent (BFGD) algorithm. Robustness becomes achievable by adopting Tukey’s biweight loss function for the design of the robust SSA filter. The SSA filter requires breaking down common-receiver gathers or common offset gathers into small overlapping windows. The traditional SSA method needs the filter rank as an input parameter, which can vary from window to window. The latter has been a shortcoming for the application of classical SSA filtering to complex seismic data processing. The proposed robust SSA filter is less sensitive to rank-selection, making it appealing for deblending applications that require windowing. Additionally, the robust SSA projection provides an effective attenuation of random source interferences during the initial iterations of the PGD method. Comparing classical and robust SSA filters, we also report an acceleration of the PGD method convergence when we adopt the robust SSA filter. Finally, we provide synthetic and real data examples, and discuss heuristic strategies for parameter selection.
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.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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