Optimal Algorithm Selection in Multimodal Medical Image Registration
Bibliographic record
Abstract
Many medical applications benefit from the diversity inherent in imaging technologies to obtain more reliable diagnoses and assessments. Typically, the images obtained from multiple sources are acquired at distinct times and from different viewpoints, rendering a multitude of challenges for the registration process. Furthermore, different areas of the human body require disparate registration functional capabilities and degrees of accuracy. Thus, the benefit attained from the image multiplicity hinges heavily on the imaging modalities employed as well as the accuracy of the alignment process. It is no surprise then that a wide range of registration techniques has emerged in the last two decades. Nevertheless, it is widely acknowledged that despite the many attempts, no registration technique has been able to deliver the required accuracy consistently under diverse operating conditions. This paper introduces a novel method for achieving multimodal medical image registration based on exploiting the complementary and competitive nature of the algorithmic approaches behind a wide range of registration techniques. First, a thorough investigation of a wide range of registration algorithms is conducted for the purpose of understanding and quantifying their registration capabilities as well as the influence of their control parameters. Subsequently, a supervised randomized machine learning strategy is proposed for selecting the best registration algorithm for a given registration instance, and for determining the optimal control parameters for such algorithm. Several experiments have been conducted to verify the capabilities of the proposed selection strategy with respect to registration reliability, accuracy, and robustness.
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.004 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 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.001 | 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".