MétaCan
Menu
Back to cohort
Record W1976129499 · doi:10.1002/nla.715

Numerical optimization for constrained image registration

2010· article· en· W1976129499 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.

Bibliographic record

VenueNumerical Linear Algebra with Applications · 2010
Typearticle
Languageen
FieldEngineering
TopicAdvanced Numerical Methods in Computational Mathematics
Canadian institutionsMcMaster University
Fundersnot available
KeywordsSolverImage registrationAugmented Lagrangian methodDiscretizationMultigrid methodConstraint (computer-aided design)Focus (optics)Domain (mathematical analysis)Mathematical optimizationImage (mathematics)Computer scienceMatching (statistics)Volume (thermodynamics)AlgorithmMathematicsArtificial intelligenceGeometryPartial differential equation

Abstract

fetched live from OpenAlex

Abstract Image registration or image matching is a technique to establish meaningful correspondences between points in different scenes. It is a mandatory tool for various applications in medicine, geoscience, and other disciplines. However, obtaining plausible deformations is a complex task. For example, many applications require the transformations to be locally invertible, or even harder, keep volume changes within a reasonable bandwidth. In this work, solutions to the registration problem are obtained by direct imposition of a volume constraint on each voxel in a discretized domain. In contrast to previous work, the focus here is on development of an efficient and robust numerical algorithm and in particular, the study of an augmented Lagrangian method with a multigrid solver. The paper demonstrates that this combination yields an almost optimal solver (i.e. linear time) for the problem. Copyright © 2010 John Wiley & Sons, Ltd.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.100
Threshold uncertainty score0.895

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.012
GPT teacher head0.288
Teacher spread0.276 · 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