Efficient Least Squares Multimodal Registration With a Globally Exhaustive Alignment Search
Bibliographic record
Abstract
There are many image registration situations in which the initial misalignment of the two images is large. These registration problems, often involving comparison of the two images only within a region of interest (ROI), are difficult to solve. Most intensity-based registration methods perform local optimization of their cost function and often miss the global optimum when the initial misregistration is large. The registration of multimodal images makes the problem even more difficult since it limits the choice of available cost functions. We have developed an efficient method, capable of multimodal rigid-body registration within an ROI, that performs an exhaustive search over all integer translations, and a local search over rotations. The method uses the fast Fourier transform to efficiently compute the sum of squared differences cost function for all possible integer pixel shifts, and for each shift models the relationship between the intensities of the two images using linear regression. Test cases involving medical imaging, remote sensing and forensic science applications show that the method consistently brings the two images into close registration so that a local optimization method should have no trouble fine-tuning the solution.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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".