Spine Image Fusion Via Graph Cuts
Bibliographic record
Abstract
This study investigates a novel CT/MR spine image fusion algorithm based on graph cuts. This algorithm allows physicians to visually assess corresponding soft tissue and bony detail on a single image eliminating mental alignment and correlation needed when both CT and MR images are required for diagnosis. We state the problem as a discrete multilabel optimization of an energy functional that balances the contributions of three competing terms: (1) a squared error, which encourages the solution to be similar to the MR input, with a preference to strong MR edges; (2) a squared error, which encourages the solution to be similar to the CT input, with a preference to strong CT edges; and (3) a prior, which favors smooth solutions by encouraging neighboring pixels to have similar fused-image values. We further introduce a transparency-labeling formulation, which significantly reduces the computational load. The proposed graph-cut fusion guarantees nearly global solutions, while avoiding the pix elation artifacts that affect standard wavelet-based methods. We report several quantitative evaluations/comparisons over 40 pairs of CT/MR images acquired from 20 patients, which demonstrate a very competitive performance in comparisons to the existing methods. We further discuss various case studies, and give a representative sample of the results.
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.001 | 0.002 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".