Bibliographic record
Abstract
An important problem in medical image analysis is the segmentation of anatomical regions of interest. Once regions of interest are segmented, one can extract shape, appearance, and structural features that can be analyzed for disease diagnosis or treatment evaluation. Diffusion tensor magnetic resonance imaging (DT-MRI) is a relatively new medical imaging modality that captures unique water diffusion properties and fiber orientation information of the imaged tissues. In this paper, we extend the interactive multidimensional graph cuts segmentation technique to operate on DT-MRI data by utilizing latest advances in tensor calculus and diffusion tensor dissimilarity metrics. The user interactively selects certain tensors as object ("obj") or background ("bkg") to provide hard constraints for the segmentation. Additional soft constraints incorporate information about both regional tissue diffusion as well as boundaries between tissues of different diffusion properties. Graph cuts are used to find globally optimal segmentation of the underlying 3D DT-MR image among all segmentations satisfying the constraints. We develop a graph structure from the underlying DT-MR image with the tensor voxels corresponding to the graph vertices and with graph edge weights computed using either Log-Euclidean or the J-divergence tensor dissimilarity metric. The topology of our segmentation is unrestricted and both obj and bkg segments may consist of several isolated parts. We test our method on synthetic DT data and apply it to real 2D and 3D MRI, providing segmentations of the corpus callosum in the brain and the ventricles of the heart.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
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 teacher head, 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".