Fast sparsity-promoting least-squares migration with multiples in the time domain
Bibliographic record
Abstract
Summary: Based on the latest developments of research in inversion technology with optimization, researchers have made significant progress in the implementation of least-squares reverse-time migration (LS-RTM) of primaries. In Marine data however, these applications rely on the success of a pre-imaging separation of primaries and multiples, which can be modeled as a multi-dimensional convolution between the vertical derivative of the surface-free Green’s function and the down-going receiver wavefield. Instead of imaging the primaries and multiples separately, we implement the LS-RTM of the total down-going wavefield by combining areal source injection and linearized Born modelling, where strong surface related multiples are generated from a strong density variation at the ocean bottom. The advantage including surface related multiples in LS-RTM is the extra illumination we obtain from these multiples without incurring additional computational costs related to carrying out multi-dimensional convolutions part of conventional multiple prediction procedures. Even though we are able to avert these computational costs, our approach shares the large costs of LSRTM. We reduce these costs by combining randomized source subsampling with our sparsity-promoting imaging technology, which produces artifact-free, high-resolution images, with the surface-related multiples migrated properly. Presentation Date: Monday, September 25, 2017 Start Time: 2:40 PM Location: Exhibit Hall C, E-P Station 2 Presentation Type: EPOSTER
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.005 | 0.002 |
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".