A wavelet thresholding technique for local geoid and deflection of the vertical determination using a planar approximation
Bibliographic record
Abstract
SUMMARY A computational scheme using the wavelet transform is employed for local geoid determination, where wavelet multiresolution analysis (MRA) is introduced as an alternative approach to the well-established fast Fourier transform (FFT). The Stokes and Vening Meinesz integrals are approximated in finite MRA subspaces. The algorithm is built using an orthogonal wavelet base function. The characteristics of the base function and its effect on the final result are investigated. Hard and soft thresholding are tested in the compression of the kernel as well as global thresholding is compared to level-wise thresholding to optimize the compression level with an acceptable accuracy. Both global and level-wise thresholding are combined in order to achieve the maximum compression level, with acceptable geoid accuracy. The compression rate depends on the degree of singularity of the kernel. In the case of Stokes, a 94 per cent compression level is achieved with 1 cm (rms) accuracy in comparison to FFT and numerical integration approaches. Due to its stronger singularity, in the case of the Vening Meinesz kernel, 97 per cent compression rate is achieved with a 0.07 arc-second (rms) accuracy. The compression percentages achieved in this study are higher than those reported in pervious studies, which shows that this algorithm is very suitable for use in local geoid determination.
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.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 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".