Application of Hilbert-Huang Decomposition to Reduce Noise and Characterize for NMR FID Signal of Proton Precession Magnetometer
Bibliographic record
Abstract
The parameters in a nuclear magnetic resonance free induction decay (FID) signal contain information that is useful in magnetic field measurement, magnetic resonance sounding and other related applications. A real time sampled FID signal is well modeled as a finite mixture of exponential sequences plus noise. We propose to use the Hilbert-Huang transform (HHT) for noise reduction and characterization, where the generalized Hilbert-Huang represents a way to decompose a signal into so-called intrinsic mode function (IMF) along with a trend, and obtain instantaneous frequency data. First, acquiring the actual untuned FID signal by a developed prototype of proton magnetometer, and then the empirical mode decomposition is performed to decompose the noise and original FID. Finally, the HHT is applied to the obtained IMFs to extract the Hilbert energy spectrum of the signal on the frequency axis. By theory analysis and the testing of an actual FID signal, the results show that, compared with general noise reduction methods such as auto correlation and singular value decomposition, combined with the proposed method can further suppress the interfered signals effectively, and can obtain different components of FID signal, which can be used to identify the magnetic anomaly, the existence of groundwater etc. This is a very important property since it can be exploited to separate the FID signal from noise and to estimate exponential sequence parameters of FID signal.
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".