Glioma Segmentation Using a Novel Unified Algorithm in Multimodal MRI Images
Bibliographic record
Abstract
To achieve the better segmentation performance, we propose a unified algorithm for automatic glioma segmentation. In this paper, we first use spatial fuzzy c-mean clustering to estimate region-of-interest in multimodal MRI images, and then extract some seed points from there for region growing based on a new notion “affinity”. In the end, we design a two-step strategy to refine the glioma border with region merging and improved distance regularization level set method. In BRATS 2015 database, we evaluate the accuracy and robustness of our method with performance scores, including dice, positive predictive value (PPV), and sensitivity metrics, as well as Hausdorff and Euclidean distance (HD&ED). The high metric values (dice = 0.86, PPV = 0.90, and sensitivity = 0.84) and small distance errors (HD = 14.39 mm and ED = 3.31 mm) indicate a remarkable accuracy. Also, we observe the ranking is No.1 in terms of dice and PPV, comparing with the state-of-the-art methods. In addition, the robustness is also at a high-level due to the refinement structure. And Spearman's rank coefficient test verities a significant correlation between the high-grade gliomas and low-grade gliomas. Overall, the proposed method is effective in segmenting gliomas in multimodal images or flair images, and has the potential in routine examinations of gliomas in daily clinical practice.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.004 | 0.003 |
| 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.001 |
| 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".