Least-squares wave-equation migration for AVP/AVA inversion
Bibliographic record
Abstract
Abstract We present an acoustic migration/inversion algorithm that uses extended double-square-root wave-equation migration and modeling operators to minimize a constrained least-squares data misfit function (least-squares migration). We employ an imaging principle that allows for the extraction of ray-parameter-domain common image gathers (CIGs) from the propagated seismic wavefield. The CIGs exhibit amplitude variations as a function of half-offset ray parameter (AVP) closely related to the amplitude variation with reflection angle (AVA). Our least-squares wave-equation migration/inversion is constrained by a smoothing regularization along the ray parameter. This approach is based on the idea that rapid amplitude changes or discontinuities along the ray parameter axis result from noise, incomplete wavefield sampling, and numerical operator artifacts. These discontinuities should therefore be penalized in the inversion. The performance of the proposed algorithm is examined with two synthetic examples. In the first case, we generated acoustic finite difference data for a horizontally layered model. The AVP functions based on the migrated/inverted ray parameter CIGs were converted to AVA plots. The AVA plots were then compared to the true acoustic AVA of the reflectors. The constrained least-squares inversion compares favorably with the conventional migration, especially when incompleteness compromises the data. In the second example, we use the Marmousi data set to test the algorithm in complex media. The result shows that least-squares migration can mitigate kinematic artifacts in the ray-parameter domain CIGs effectively.
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.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| 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.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".