Adaptive separation of free-surface multiples through independent component analysis
Bibliographic record
Abstract
Abstract We present a three-stage algorithm for adaptive separation of free-surface multiples. The free-surface multiple elimination (FSME) method requires, as deterministic prerequisites, knowledge of the source wavelet and deghosted data. In their absence, FSME provides an estimate of free-surface multiples that must be subtracted adaptively from the data. First we construct several orders from the free-surface multiple prediction formula. Next we use the full recording duration of any given data trace to construct filters that attempt to match the data and the multiple predictions. This kind of filter produces adequate phase results, but the order-by-order nature of the free-surface algorithm brings results that remain insufficient for straightforward subtraction. Then we construct, trace by trace, a mixing model in which the mixtures are the data trace and its orders of multiple predictions. We separate the mixtures through a blind source separation technique, in particular by employing independent component analysis. One of the recovered signals is a data trace without free-surface multiples. This technique sidesteps the subtraction inherent in most adaptive subtraction methods by separating the desired signal from the free-surface multiples. The method was applied to synthetic and field data. We compared the field data to a published method and found comparable results.
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.002 |
| 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.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.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".