Fast and robust 3D vertebra segmentation using statistical shape models
Bibliographic record
Abstract
We propose a top-down fully automatic 3D vertebra segmentation algorithm using global shape-related as well as local appearance-related prior information. The former is brought into the system by a global statistical shape model built from annotated training data, i.e., annotated CT volumes. The latter is handled by a machine learning-based component, i.e., a boundary detector, providing a strong discriminative model for vertebra surface appearance by making use of local context-encoding features. This boundary detector, which is essentially a probabilistic boosting-tree classifier, is also learnt from annotated training data. Contextual information is taken into account by representing vertebra surface candidate voxels with high-dimensional vectors of 3D steerable features derived from the observed volume intensities. Our system does not only consider the body of the individual vertebrae but also the spinal processes. Before segmentation, the image parts depicting individual vertebrae are spatially normalized with respect to their bounding box information in terms of translation, orientation, and scale leading to more accurate results. We evaluate segmentation accuracy on 7 CT volumes each depicting 22 vertebrae. The results indicate a symmetric point-to-mesh surface error of 1.37 ± 0.37 mm, which matches the current state-of-the-art.
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.002 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.003 |
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".