Low-frequency noise suppression for desert seismic data based on a wide inference network
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
Abstract The importance of seismic exploration has been recognized by geophysicists. At present, low-frequency noise usually exists in seismic exploration, especially in desert seismic records. This low-frequency noise shares the same frequency band with effective signals. This leads to the limitation or failure of traditional methods. In order to overcome the shortcomings of traditional denoising methods, we propose a novel desert seismic data denoising method based on a Wide Inference Network (WIN). The WIN aims to minimize the error between the prediction and target by residual learning during training, and it can obtain a set of optimal parameters, such as weights and biases. In this article, we construct a high-quality training set for a desert seismic record and this ensures the effective training of a WIN. In this way, each layer of the trained WIN can automatically extract a set of time–space characteristics without manual adjustment. These characteristics are transmitted layer by layer. Finally, they are utilized to extract effective signals. To verify the effectiveness of the WIN, we apply it to synthetic and real desert seismic records, respectively. In addition, we compare WIN with f – x deconvolution, variational mode decomposition (VMD) and shearlet transform. The results show that WIN has the best denoising performance in suppressing low-frequency noise and preserving effective signals.
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.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 it