3D gravity inversion with optimized mesh based on edge and center anomaly detection
Bibliographic record
Abstract
ABSTRACT Gravity inversion is inherently nonunique. Minimum-structure inversion has proved effective at dealing with this nonuniqueness. However, such an inversion approach, which involves a large number of unknown parameters, is computationally expensive. To improve efficiency while retaining the advantages of a minimum-structure-style inversion, we have developed a new method, based on edge detection and center detection of geologic bodies, to help to focus the spatial extent of meshing for gravity inversion. The chosen method of edge detection, normalized vertical derivative of the total horizontal derivative, helps to outline areas to be meshed by approximating the edges of key geophysical bodies. Next, the method of center detection, normalized vertical derivative of the analytic signal amplitude, helps to confirm the center of the areas to be meshed, then a binary mesh flag is generated. In this paper, the binary mesh flag, restricting the spatial extent of meshing, is first undertaken using the two methods, and it is shown to dramatically reduce the number of grid cells from 574,992 for the whole research volume to 170,544 for the localized mesh by the same size of cell, which is decreased by almost 70%. Second, gravity inversion is performed using the spatially restricted mesh. The recovered model constructed using the binary mesh flag is similar to the model obtained using the mesh spanning the whole volume and saves approximately 80% of the CPU time. Finally, a real gravity data example from Olympic Dam in Australia is successfully used to test the validity and practicability of this proposed method. The geologic source bodies are resolved between 250 and 750 m depth. Overall, the combination of edge detection and center detection, and our binary mesh flag, succeed in reducing the number of cells and saving the CPU time and computer storage required for gravity inversion.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".