<title>Classification and performance of denoising algorithms for low signal-to-noise ratio magnetic resonance images</title>
Bibliographic record
Abstract
The generation of magnitude magnetic resonance images comprises a sequence of data encodings or transformations, from detection of an analog electrical signal to a digital phase/frequency k-space to a complex image space via an inverse Fourier transform and finally to a magnitude image space via a magnitude transformation and rescaling. Noise present in the original signal is transformed at each step of this sequence. Denoising MR images from low field strength scanners is important because such images exhibit low signal to noise ratio. Algorithms that perform denoising of magnetic resonance images may be usefully classified according to the data domain on which they operate (i.e. at which step of the sequence of transformations they are applied) and the underlying statistical distribution of the noise they assume. This latter dimension is important because the noise distribution for low SNR images may be decidedly non-Gaussian. Examples of denoising algorithms include 2D wavelet thresholding (operates on the wavelet transform of the magnitude image; assumes Gaussian noise), Nowak's 2D wavelet filter (operates on the squared wavelet transform of the magnitude image; assumes Rician noise), Alexander et. al.'s complex 2D filters (operates on the wavelet transform of the complex image space; assumes Gaussian noise), wavelet packet denoising (wavelet packet transformation of magnitude image; assumes Rician noise) and anisotropic diffusion filtering (operates directly on magnitude image; no assumptions on noise distribution). Effective denoising of MR images must take into account both the availability of the underlying data, and the distribution of the noise to be removed. We classify a number of recently published denoising algorithms and compare their performance on images from a 0.35T permanent magnet MR scanner.
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.001 | 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".