Background field removal using spherical mean value filtering and Tikhonov regularization
Bibliographic record
Abstract
PURPOSE: To introduce a new method for removing background artifacts in field maps and apply it to enhance the accuracy of susceptibility mapping. METHODS: A field artifact removal method is introduced that is based on the sophisticated harmonic artifact reduction for phase data (SHARP) method exploiting the harmonic mean value property. The new method uses Tikhonov regularization at the deconvolution stage and is referred to as regularization enabled SHARP (RESHARP). RESHARP was compared with SHARP in a field-forward susceptibility simulation and in human brain experiments, considering effects on both field maps and the resulting susceptibility maps. RESULTS: From the simulation, RESHARP was able to reduce error in the field map by 17.4% as compared with SHARP, resulting in a more accurate single-angle susceptibility map with 6.5% relative error (compared with 48.5% using SHARP). Using RESHARP in vivo, field and susceptibility maps of the brain displayed fewer artifacts particularly at the brain boundaries, and susceptibility measurements of iron-rich deep gray matter were also more consistent than SHARP across healthy subjects of similar age. CONCLUSION: Compared with SHARP, RESHARP removes background field artifact more effectively, leading to more accurate susceptibility measurements in iron-rich deep gray matter.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".