Offset-extended sparse Radon transform: Application to multiple suppression in the presence of amplitude variations with offset
Bibliographic record
Abstract
ABSTRACT The conventional Radon transform suffers from a lack of resolution when data kinematics and amplitudes differ from those of the Radon basis functions. Also, a limited aperture of data, missing traces, aliasing, a finite number of scanned ray parameters, noise, residual statics, and amplitude variations with offset (AVO) reduce the decorrelation power of the Radon basis functions. Posing Radon transform estimation as an inverse problem by searching for a sparse model that fits the data improves the performance of the algorithm. However, due to averaging along the offset axis, the conventional Radon transform cannot preserve AVO. Accordingly, we modify the Radon basis functions by extending the model domain along the offset direction. Extending the model space helps in fitting data; however, computing the offset-extended Radon transform is an underdetermined and ill-posed problem. To alleviate this shortcoming, we add model domain sparsity and smoothing constraints to yield a stable solution. We have developed an algorithm using offset-extended Radon basis functions with sparsity promoting in offset-stacked Radon images in conjunction with a smoothing restriction along the offset axis. Because the inverted model is sparse and fits the data, muting common-offset Radon panels based on ray-parameter/curvature is sufficient for separating primaries from multiples. We successfully apply the algorithm to suppress multiples in the presence of strong AVO on synthetic data and a real data example from the Gulf of Mexico, Mississippi Canyon. The results indicate that extending the Radon model space is necessary for improving the separation and suppression of the multiples in the presence of strong AVO.
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".