MétaCan
Menu
Back to cohort
Record W2071105408 · doi:10.1117/12.595677

MRI denoising via phase error estimation

2005· article· en· W2071105408 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2005
Typearticle
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsSimon Fraser University
FundersSimon Fraser University
KeywordsComputer scienceSmoothingNoise reductionPixelNoise (video)AlgorithmArtificial intelligenceImage (mathematics)Phase (matter)Pattern recognition (psychology)Computer vision

Abstract

fetched live from OpenAlex

If the phase error at each pixel in a complex-valued MRI image is known the noise in the image can be reduced resulting in improved detection of medically significant details. However, given a complex-valued MRI image, estimating the phase error at each pixel is a difficult problem. Several approaches have previously been suggested including non-linear least squares fitting and smoothing filters. We propose a new scheme based on iteratively applying a series of non-linear filters, each used to modify the estimate into greater agreement with one piece of knowledge about the problem, until the output converges to a stable estimate. We compare our results with other phase estimation and MRI denoising schemes using synthetic data.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.658
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.016
GPT teacher head0.276
Teacher spread0.260 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it